Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818)
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: Algorithms for GA- H reduced graphs |
scientific article; zbMATH DE number 6510086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs |
scientific article; zbMATH DE number 6510086 |
Statements
Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (English)
0 references
17 November 2015
0 references
graph algorithm
0 references
\(\mathcal{H}\)-mixed graph
0 references
subgraph overlap graph
0 references
subtree filament graph
0 references
maximum independent set
0 references
0.8859766125679016
0 references
0.7800943851470947
0 references
0.7591189742088318
0 references
0.7260633111000061
0 references
