Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.68497OpenAlexW2501059503MaRDI QIDQ5475825

Tsuyoshi Osumi, Hiro Ito, Kazuo Iwama

Publication date: 27 June 2006

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Isolation concepts for efficiently enumerating dense subgraphs ⋮ Web Structure Mining by Isolated Stars ⋮ Contracted Webgraphs: Structure Mining and Scale-Freeness ⋮ The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs ⋮ Cliques with maximum/minimum edge neighborhood and neighborhood density ⋮ A classification for community discovery methods in complex networks ⋮ Isolation concepts for clique enumeration: comparison and computational experiments ⋮ Enumerating Isolated Cliques in Synthetic and Financial Networks

This page was built for publication: Algorithms – ESA 2005