Graph-Theoretic Concepts in Computer Science

From MaRDI portal

Revision as of 17:51, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:5897566

Jump to:navigation, search

DOI10.1007/11604686zbMath1171.05348MaRDI QIDQ5897566

Torsten Tholey

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (3)

Linear time algorithms for two disjoint paths problems on directed acyclic graphs ⋮ The Directed Disjoint Shortest Paths Problem ⋮ Solving the selective multi-category parallel-servicing problem

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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