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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs |
scientific article |
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
