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

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

zbMath0732.90087MaRDI QIDQ3360021

Alexander Schrijver

Publication date: 1990


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

zbMATH Keywords

polynomial algorithmplanar graphvertex and edge disjoint pathshomotopic routing


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (8)

A Mixed Integer Model for the Sparsest Cut problem ⋮ Unnamed Item ⋮ Optimum path packing on wheels: The consecutive case ⋮ On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems ⋮ Multiflow Feasibility: An Annotated Tableau ⋮ Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ Minimal multicut and maximal integer multiflow: a survey




This page was built for publication:

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