Computing and Combinatorics
From MaRDI portal
Publication:4681173
DOI10.1007/b99243zbMath1091.68562OpenAlexW2491887524MaRDI QIDQ4681173
Haruhisa Takahashi, Etsuji Tomita, Akira Tanaka
Publication date: 15 June 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99243
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
The worst-case time complexity for generating all maximal cliques and computational experiments, A survey on enhanced subspace clustering, All 2-planar graphs having the same spanning subgraph, Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications, On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, Interval vertex-coloring of a graph with forbidden colors, The maximum clique problem
