Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5710793
DOI10.1007/b104584zbMath1112.68421OpenAlexW4211210842MaRDI QIDQ5710793
Jean-Luc Fouquet, Fabien de Montgolfier, Michel A. Habib, Jean-Marie Vanherpe
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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Graph parameters measuring neighbourhoods in graphs-bounds and applications
This page was built for publication: Graph-Theoretic Concepts in Computer Science
