arXiv CS
open access
Enumerating Small Potential Maximal Cliques with Fixed-Parameter Delay
A potential maximal clique (PMC) of a graph $G$ is a nonempty vertex set that forms a maximal clique in some minimal triangulation of $G$. Listing the PMCs of a graph is a key step in exact algorithms for computing treewidth, minimum fill-in, and related graph parameters. We present a deterministic
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Enumerating Small Potential Maximal Cliques with Fixed-Parameter Delay#1389802
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
- Enumeration of regular multipartite hypergraphs#1049618
- On the Brouwer-type Conjecture for Signless Laplacian Eigenvalues of Graphs#1106054
- LCA queries in directed acyclic graphs#420805
Record · ID 1381348
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive