A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5284994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs |
scientific article; zbMATH DE number 5284994 |
Statements
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (English)
0 references
5 June 2008
0 references
Pfaffian graphs
0 references
polynomial time algorithms
0 references
matching theory
0 references
matching covered graphs
0 references
0.9265984892845154
0 references
0.8389082551002502
0 references
0.8308117389678955
0 references
0.8207447528839111
0 references
