A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655)
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: A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs |
scientific article; zbMATH DE number 7119188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs |
scientific article; zbMATH DE number 7119188 |
Statements
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (English)
0 references
18 October 2019
0 references
critical nodes
0 references
graph connectivity
0 references
bipartite permutation graphs
0 references
dynamic programming
0 references
complete bipartite decomposition
0 references
graph separators
0 references
0 references
0 references
0.8167234063148499
0 references
0.8024338483810425
0 references
0.7675977349281311
0 references
0.7630365490913391
0 references
0.7625516057014465
0 references
