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

LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS

From MaRDI portal
Publication:4886310
Jump to:navigation, search

DOI10.1142/S0129054196000087zbMath0852.68068OpenAlexW2137173571MaRDI QIDQ4886310

Karsten Weihe, Dorothea Wagner, Heike Ripphausen-Lipa

Publication date: 26 November 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054196000087


zbMATH Keywords

planar graphsvertex-disjoint pathslinkage problemtwo-face paths problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)





This page was built for publication: LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4886310&oldid=19257470"
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 05:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki