A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808): Difference between revisions
From MaRDI portal
Latest revision as of 18:59, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallelizable lexicographically first maximal edge-induced subgraph problem |
scientific article |
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
