A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808)
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: A parallelizable lexicographically first maximal edge-induced subgraph problem |
scientific article; zbMATH DE number 4068315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallelizable lexicographically first maximal edge-induced subgraph problem |
scientific article; zbMATH DE number 4068315 |
Statements
A parallelizable lexicographically first maximal edge-induced subgraph problem (English)
0 references
1988
0 references
The lexicographically first maximal 3-cycle free edge-induced subgraph problem is in \(NC^ 2\) when the instances are graphs without any subgraphs homeomorphic to \(K_ 4\).
0 references
NC
0 references
maximal subgraph problem
0 references
triangle-free
0 references
outerplanar
0 references
3-cycle free edge-induced subgraph
0 references
