Special data structures for problems on graphs associated with the notion of clique or with modular decomposition
zbMATH Open1271.05095MaRDI QIDQ2849145FDOQ2849145
Authors: A. Kh. Perez Chernov, S. V. Suzdal' 
Publication date: 16 September 2013
Published in: Vestnik Belorusskogo Gosudarstvennogo Universiteta. Seria 1. Fizika, Matematika, Informatika (Search for Journal in Brave)
Recommendations
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- The clique structure of a graph
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- scientific article; zbMATH DE number 4053039
- Algorithmic aspects of a general modular decomposition theory
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Special data structures for problems on graphs associated with the notion of clique or with modular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849145)
