Computing \(k\)-independent sets for regular bipartite graphs (Q2717906)
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: Computing \(k\)-independent sets for regular bipartite graphs |
scientific article; zbMATH DE number 1606008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing \(k\)-independent sets for regular bipartite graphs |
scientific article; zbMATH DE number 1606008 |
Statements
26 July 2001
0 references
bipartite graphs
0 references
regular graphs
0 references
\(k\)-independent set problem
0 references
NP-complete
0 references
0.91764665
0 references
0.9069491
0 references
0.90694904
0 references
0.9063557
0 references
0.9018164
0 references
0 references
0.90141565
0 references
0.90141565
0 references
Computing \(k\)-independent sets for regular bipartite graphs (English)
0 references
