scientific article; zbMATH DE number 1839474

From MaRDI portal

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

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

Publication:4782743

Jump to:navigation, search

zbMath0999.68160MaRDI QIDQ4782743

Danica Vukadinović Greetham, Erlebach, Thomas

Publication date: 2 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380483

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Solving the edge‐disjoint paths problem using a two‐stage method ⋮ The maximum edge-disjoint paths problem in complete graphs

This page was built for publication:

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