Detecting 2-joins faster (Q2376790)
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: Detecting 2-joins faster |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting 2-joins faster |
scientific article |
Statements
Detecting 2-joins faster (English)
0 references
24 June 2013
0 references
2-join
0 references
edge cutset
0 references
detection
0 references
closed classes of graphs
0 references
induced subgraphs
0 references
balanced bipartite graphs
0 references
even-hole-free graphs
0 references
perfect graphs
0 references
claw free graphs
0 references
0 references
0.8503827452659607
0 references
0.7748221755027771
0 references
0.757056713104248
0 references
0.7536212801933289
0 references
0.7419651746749878
0 references
