Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902510
DOI10.1007/b93953zbMath1255.05186MaRDI QIDQ5902510
Geneviève Simonet, Anne Berry, Pinar Heggernes
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Minimal triangulations of graphs: a survey ⋮ Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree ⋮ Characterizing and Computing Minimal Cograph Completions ⋮ Treewidth computations. I: Upper bounds ⋮ Characterizing and computing minimal cograph completions ⋮ Fast minimal triangulation algorithm using minimum degree criterion ⋮ Faster and enhanced inclusion-minimal cograph completion ⋮ Unnamed Item ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ Unnamed Item ⋮ Tree decompositions and social graphs
Uses Software
This page was built for publication: Graph-Theoretic Concepts in Computer Science
