Graphentheoretische Konzepte und Algorithmen
DOI10.1007/978-3-8348-2264-2zbMATH Open1248.05001OpenAlexW4231983684MaRDI QIDQ2918941FDOQ2918941
Hartmut Noltemeier, Sven O. Krumke
Publication date: 2 October 2012
Published in: Leitfäden der Informatik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-8348-2264-2
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)
Cited In (6)
- Algorithms in graph theory and their use for solving problems in architectural design
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating star-shaped blocks for scaled boundary multipatch IGA
- Simultaneously dominating all spanning trees of a graph
This page was built for publication: Graphentheoretische Konzepte und Algorithmen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918941)
