Listing all potential maximal cliques of a graph
type: Item
instance of: scholarly article
title: Listing all potential maximal cliques of a graph
zbMATH Open document ID: 1002.68104
DOI: 10.1016/S0304-3975(01)00007-X
author: Ioan Todinca
author: Vincent Bouchitté
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1768172
zbMATH Keywords: graph algorithms
zbMATH Keywords: treewidth
zbMATH Keywords: minimal separators
zbMATH Keywords: potential maximal cliques
MaRDI profile type: Publication
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: An algebraic theory of graph reduction
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q4291429
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Q4699283
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Q4250226
cites work: Q4252036
cites work: Q4251051
cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Q3328583
cites work: Dynamic algorithms for graphs of bounded treewidth
cites work: Inferring Evolutionary History From DNA Sequences
cites work: Treewidth of Chordal Bipartite Graphs
cites work: Listing all Minimal Separators of a Graph
cites work: Approximating the bandwidth for asteroidal triple-free graphs
cites work: On treewidth and minimum fill-in of asteroidal triple-free graphs
cites work: Minimum Fill-in on Circle and Circular-Arc Graphs
cites work: The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Graph minors. III. Planar tree-width
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Triangulated graphs and the elimination process
cites work: Treewidth of Circular-Arc Graphs
cites work: All structured programs have small tree width and good register allocation
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
full work available at URL: 3-540-46541-3 42
OpenAlex ID: W1569612812
Wikidata QID: Q127908699
description: scientific article; zbMATH DE number 1768172