A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(86)90036-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030774898 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring |
scientific article |
Statements
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (English)
0 references
1986
0 references
The author gives an O(\(\Delta| E|)\) algorithm (\(\Delta\) denotes the maximum degree) for the construction of edge maximal subgraph G' of a given graph G with the property that there exists an edge 2-coloring of G' such that one color induces a triangulated subgraph of G' while the complementary color induces a subgraph of G' without triangles. These researches have applications in maximum clique finding enumerative algorithms.
0 references
triangulated graph
0 references
algorithm
0 references
edge maximal subgraph
0 references
edge 2-coloring
0 references
maximum clique
0 references
