Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 6146454

From MaRDI portal
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 pathgraph algorithmplanar graphdisjoint 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"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 07:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki