The edge versus path incidence matrix of series-parallel graphs and greedy packing

DOI10.1016/S0166-218X(00)00294-8zbMath0991.05070MaRDI QIDQ5951970

Alan J. Hoffman, Baruch Schieber

Publication date: 28 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

incidence matrixdirected graphpathpacking problemseries-parallel graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Theory and application of conflict resolution with hybrid preference in colored graphs ⋮ Theory and implementation of coalitional analysis in cooperative decision making ⋮ A matrix-based approach to searching colored paths in a weighted colored multidigraph

Cites Work

• On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
• Minimum cost flow algorithms for series-parallel networks
• Greedy packing and series-parallel graphs