Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833)
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: Connected Coloring Completion for General Graphs: Algorithms and Complexity |
scientific article; zbMATH DE number 5523827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connected Coloring Completion for General Graphs: Algorithms and Complexity |
scientific article; zbMATH DE number 5523827 |
Statements
Connected Coloring Completion for General Graphs: Algorithms and Complexity (English)
0 references
6 March 2009
0 references
algorithms and complexity
0 references
bioinformatics
0 references
0.7887175679206848
0 references
0.7881687879562378
0 references
0.7732574939727783
0 references
0.7703399062156677
0 references
0.7653288841247559
0 references
