Listing all potential maximal cliques of a graph (Q1605302): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / cites work | |||
| Property / cites work: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-46541-3_42 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1569612812 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127908699 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 4 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Listing all potential maximal cliques of a graph |
scientific article |
Statements
Listing all potential maximal cliques of a graph (English)
0 references
15 July 2002
0 references
graph algorithms
0 references
treewidth
0 references
minimal separators
0 references
potential maximal cliques
0 references
0 references
