Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655)
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: Distance-d independent set problems for bipartite and chordal graphs |
scientific article; zbMATH DE number 6261685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-\(d\) independent set problems for bipartite and chordal graphs |
scientific article; zbMATH DE number 6261685 |
Statements
Distance-\(d\) independent set problems for bipartite and chordal graphs (English)
0 references
25 February 2014
0 references
distance-\(d\) independent set
0 references
bipartite graphs
0 references
chordal graphs
0 references
computational complexity
0 references
0 references
0.9717769622802734
0 references
0.8374766707420349
0 references
0.8022950291633606
0 references
0.8005144596099854
0 references
0.7960025668144226
0 references
