scientific article; zbMATH DE number 7205208

DOI10.4230/LIPIcs.IPEC.2017.24zbMath1443.68134arXiv1706.06086MaRDI QIDQ5111883

Anna Zych-Pawlewicz, Marcin Pilipczuk, Nikolai Karpov

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1706.06086

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

zbMATH Keywords

planar graphsmimicking networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Characterizing multiterminal flow networks and computing flows in networks of small treewidth
• On mimicking networks representing minimum terminal cuts
• Metric extension operators, vertex sparsifiers and Lipschitz extendability
• Flows in One-Crossing-Minor-Free Graphs
• Representative Sets and Irrelevant Vertices
• On vertex sparsifiers with Steiner nodes
• Mimicking Networks and Succinct Representations of Terminal Cuts
• Vertex Sparsifiers: New Results from Old Techniques
• Unnamed Item

This page was built for publication: