scientific article; zbMATH DE number 6146454

From MaRDI portal

Revision as of 06:23, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4910718

Jump to:navigation, search

DOI10.4230/LIPIcs.STACS.2008.1347zbMath1259.68089MaRDI QIDQ4910718

Éric Colin de Verdière, Alexander Schrijver

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_5528.html

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

zbMATH Keywords

shortest path graph algorithm planar graph disjoint paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the connectivity preserving minimum cut problem ⋮ On shortest disjoint paths in planar graphs ⋮ Theoretical and computational advances for network diversion ⋮ The Directed Disjoint Shortest Paths Problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4910718&oldid=19305272"