Minimum Cuts for Circular-Arc Graphs (Q3495653)
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: Publication:3495653 |
scientific article; zbMATH DE number 4170105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum Cuts for Circular-Arc Graphs |
scientific article; zbMATH DE number 4170105 |
Statements
Minimum Cuts for Circular-Arc Graphs (English)
0 references
1990
0 references
computational complexity
0 references
algebraic computation trees
0 references
circular-arc graphs
0 references
minimum covering
0 references
maximum independent set
0 references
minimum cut
0 references
circle graph
0 references
0.8495410680770874
0 references
0.8217436671257019
0 references
0.8170225024223328
0 references
0.8126713633537292
0 references
