On CLIQUE Problem for Sparse Graphs of Large Dimension

DOI10.1007/978-3-319-13671-4_9zbMath1336.05077OpenAlexW43306143MaRDI QIDQ3463541

Roman Illarionov, Valentina Vladimirovna Bykova

Publication date: 19 January 2016

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13671-4_9

zbMATH Keywords

treewidthgraph algorithmssparse graphspreprocessingFPT-algorithmsatom graphbiphasic algorithmsdecomposition graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition by clique separators
• Optimal decomposition by clique separators
• Mining market data: a network approach
• Algorithms for maximum independent sets
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: On CLIQUE Problem for Sparse Graphs of Large Dimension