Graph-Theoretic Concepts in Computer Science

From MaRDI portal

Revision as of 06:32, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:5902514

Jump to:navigation, search

DOI10.1007/b93953zbMath1255.68107MaRDI QIDQ5902514

Hoàng-Oanh Le, Feodor F. Dragan, Andreas Brandstädt, Van Bang Le, Ryuhei Uehara

Publication date: 12 January 2010

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

zbMATH Keywords

NP-completeness tree spanner chordal bipartite graph interval bigraph probe interval graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

The zoo of tree spanner problems

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

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