Characterizing and computing minimal cograph completions (Q972335)
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: Characterizing and computing minimal cograph completions |
scientific article; zbMATH DE number 5711867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing and computing minimal cograph completions |
scientific article; zbMATH DE number 5711867 |
Statements
Characterizing and computing minimal cograph completions (English)
0 references
25 May 2010
0 references
minimal completions
0 references
cographs
0 references
linear-time algorithms
0 references
0 references
0 references
