Solving NP-hard problems in 'almost trees': vertex cover (Q1062757): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Maximum Independent Set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank |
Latest revision as of 18:48, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving NP-hard problems in 'almost trees': vertex cover |
scientific article |
Statements
Solving NP-hard problems in 'almost trees': vertex cover (English)
0 references
1985
0 references
In the paper a new algorithm which finds a minimum vertex cover in a graph G, is proposed. Its complexity depends linearly on the number of vertices of G and exponentially on the maximum a over all biconnected components of the graph, where a is defined as the minimum number of edges that must be added to a tree to produce G. A parallel implementation of the algorithm is also given.
0 references
algorithm
0 references
minimum vertex cover
0 references
parallel implementation
0 references
0 references