The computational complexity of graph problems with succinct multigraph representation (Q3801600)
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: The computational complexity of graph problems with succinct multigraph representation |
scientific article; zbMATH DE number 4068936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of graph problems with succinct multigraph representation |
scientific article; zbMATH DE number 4068936 |
Statements
The computational complexity of graph problems with succinct multigraph representation (English)
0 references
1988
0 references
graph algorithms
0 references
matching
0 references
succinct presentation
0 references
complexity
0 references
vertex multiplicity graphs
0 references
0.8483092784881592
0 references
0.7958129644393921
0 references
