The Path-Packing Structure of Graphs

The Path-Packing Structure of Graphs

We prove Edmonds-Gallai type structure theorems for Mader’s edge- and vertex-disjoint paths including also capacitated variants, and state a conjecture generalizing Mader’s minimax theorems on path packings and Cunningham and Geelen’s path-matching theorem.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sebő, András, Szegő, László
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Complementary Slackness
Exact sciences and technology
Mathematical programming
Maximum Match
Operational research and scientific management
Operational research. Management science
Structure Algorithm
Structure Theorem
Terminal Point
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove Edmonds-Gallai type structure theorems for Mader’s edge- and vertex-disjoint paths including also capacitated variants, and state a conjecture generalizing Mader’s minimax theorems on path packings and Cunningham and Geelen’s path-matching theorem.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-25960-2_20