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 1263227

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

zbMath0978.68553MaRDI QIDQ4234099

Yefim Dinitz, Zeev Nutov

Publication date: 29 January 2002


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


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)


Related Items (7)

How to draw the minimum cuts of a planar graph ⋮ Approximating minimum cuts under insertions ⋮ 2-node-connectivity network design ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Phylogenetic graph models beyond trees ⋮ Approximation algorithms for connectivity augmentation problems ⋮ 2-node-connectivity network design




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4234099&oldid=18115411"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 15:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki