scientific article; zbMATH DE number 878892

zbMath0846.05062MaRDI QIDQ4878662

No author found.

Publication date: 29 September 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

packingmatching theory\(T\)-joins\(T\)-cutsconservative weightingplanar edge-disjoint path problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (9)

\(T\)-joins in infinite graphs ⋮ \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard ⋮ Finding even subgraphs even faster ⋮ Approximate min-max relations for odd cycles in planar graphs ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ On specific factors in graphs ⋮ An Approximation Algorithm for Fully Planar Edge-Disjoint Paths ⋮ Vertex set partitions preserving conservativeness ⋮ Fast algorithms for the undirected negative cost cycle detection problem

This page was built for publication: