𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Minimax Arc Theorem for Reducible Flow Graphs

✍ Scribed by Ramachandran, Vijaya

Book ID
118196877
Publisher
Society for Industrial and Applied Mathematics
Year
1990
Tongue
English
Weight
819 KB
Volume
3
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Minimax Theorem for Directed Graphs
A Minimax Theorem for Directed Graphs
✍ Lucchesi, C. L.; Younger, D. H. πŸ“‚ Article πŸ“… 1978 πŸ› Oxford University Press 🌐 English βš– 170 KB
Parallel Algorithms for Reducible Flow G
Parallel Algorithms for Reducible Flow Graphs
✍ Vijaya Ramachandran πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 324 KB

We present parallel NC algorithms for recognizing a reducible flow graph rfg and for finding dominators, minimum feedback vertex sets, and a depth first search Ε½ . tree in an rfg. On an n-node rfg, all of these algorithms run in polylog n time Ε½ . Ε½ . using M n processors, where M n is the number o

A minimax theorem for infinite graphs wi
A minimax theorem for infinite graphs with ideal points
✍ Norbert Polat πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 617 KB

Polat, N., A minimax theorem for infinite graphs with ideal points, Discrete Mathematics 103 (1992) 57-65. Let d be a family of sets of ends of an infinite graph, having the property that every element of any member of 1 can be separated from the union of all other members by a finite set of vertice

Minimax theorems for infinite graphs wit
Minimax theorems for infinite graphs with the ends as ideal points
✍ Norbert Polat πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 532 KB

For a set ~2 of pairwise disjoint sets of ends of an infinite graph, we define the concepts of d-paths and of d-separators, and we determine the maximum number of pairwise disjoint d-path.