Computing and Combinatorics

DOI10.1007/b99243zbMath1091.68562MaRDI QIDQ4681173

Akira Tanaka, Etsuji Tomita, Haruhisa Takahashi

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

The worst-case time complexity for generating all maximal cliques and computational experiments, The maximum clique problem, Interval vertex-coloring of a graph with forbidden colors