Graph-Theoretic Concepts in Computer Science

DOI10.1007/b104584zbMath1112.68408OpenAlexW4211210842MaRDI QIDQ5710814

Ulrik Brandes, Michael Baur

Publication date: 8 December 2005

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

Full work available at URL: https://doi.org/10.1007/b104584

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Complex systems: features, similarity and connectivity ⋮ Circular right-angle crossing drawings in linear time ⋮ Stack-number is not bounded by queue-number ⋮ Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ An annotated bibliography on 1-planarity ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ The Bundled Crossing Number ⋮ Crossing minimization in extended level drawings of graphs ⋮ Visual Analysis of One-to-Many Matched Graphs ⋮ Multi-circular Layout of Micro/Macro Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Group-Level Analysis and Visualization of Social Networks ⋮ The Turing Test for Graph Drawing Algorithms ⋮ Crossing Minimisation Heuristics for 2-page Drawings

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