A note on finding compact sets in graphs represented by an adjacency list (Q1351637)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on finding compact sets in graphs represented by an adjacency list |
scientific article; zbMATH DE number 984465
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on finding compact sets in graphs represented by an adjacency list |
scientific article; zbMATH DE number 984465 |
Statements
A note on finding compact sets in graphs represented by an adjacency list (English)
0 references
27 February 1997
0 references
Adjacency list
0 references
Algorithms
0 references
Compact sets
0 references
Graphs
0 references
0.884741485118866
0 references
0.8800260424613953
0 references
0.8271611928939819
0 references
0.8187822103500366
0 references