Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244)
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: Minimum d-blockers and d-transversals in graphs |
scientific article; zbMATH DE number 6021872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum \(d\)-blockers and \(d\)-transversals in graphs |
scientific article; zbMATH DE number 6021872 |
Statements
Minimum \(d\)-blockers and \(d\)-transversals in graphs (English)
0 references
4 April 2012
0 references
transversal
0 references
blocker
0 references
cover
0 references
bipartite graph
0 references
split graph
0 references
\(s\)-\(t\) path
0 references
\(s\)-\(t\) cut
0 references
stable set
0 references
bilevel programming
0 references
0 references
0.8776577711105347
0 references
0.8258832097053528
0 references
0.7882071733474731
0 references
