Optimal covering of cacti by vertex-disjoint paths
Shlomo Moran,Yaron Wolfsthal +1 more
TLDR
This work develops an efficient optimal covering algorithm for cacti and generalizes the results of Boesch, Gimpel, McHugh and Pinter, Wolfstahl where optimal covering algorithms for trees and graphs where no two cycles share a vertex were presented.About:
This article is published in Theoretical Computer Science.The article was published on 1991-07-29 and is currently open access. It has received 34 citations till now. The article focuses on the topics: Edge cover & Covering graph.read more
Citations
More filters
Journal ArticleDOI
Linear algorithm for optimal path cover problem on interval graphs
S. Rao Arikati,C. Pandu Rangan +1 more
TL;DR: This work presents a linear algorithm for this problem on interval graphs, given the adjacency lists of an interval graph with n vertices and m edges, that runs in O(m+n) time.
Proceedings Article
An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem.
TL;DR: This paper introduces a new problem of scheduling a collection of independent tasks on a multiprocessor, called the partitionable independent task scheduling problem, and presents an approximate algorithm that guarantees a solution within (1+1/p) 2 3333333 of the optimal solution, under a reasonable assumption on the speedup functions.
Journal ArticleDOI
Fast–mixed searching and related problems on graphs
TL;DR: This paper establishes a relation between the fast–mixed search problem and the induced-path cover problem, and proves that Fast–Mixed Searching From Leaves is NP-complete, and it remains NP- complete for planar graphs with maximum degree 3.
Journal ArticleDOI
Optimal path cover problem on block graphs and bipartite permutation graphs
TL;DR: This paper presents linear-time algorithms for the optimal path cover problem for the class of block graphs and bipartite permutation graphs.
Journal ArticleDOI
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
TL;DR: An approximation algorithm is presented, with a performance ratio of at most 17⧸12, for the asymmetric travelling salesman problem with distances one and two, which is equivalent to the problem of covering the vertices of a diagraph with a minimum number of vertex-disjoint paths.
References
More filters
Book
Graph Algorithms
TL;DR: A thoroughly revised second edition of Shimon Even's Graph Algorithms, with a foreword by Richard M. Karp and notes by Andrew V Goldberg, explains algorithms in a formal but simple language with a direct and intuitive presentation.
Journal ArticleDOI
Algorithm 447: efficient algorithms for graph manipulation
TL;DR: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths and each iteration produces a new path between two vertices already on paths.
Journal ArticleDOI
The Planar Hamiltonian Circuit Problem is NP-Complete
TL;DR: The problem of determining whether a planar, cubic, triply-connected graph G has a Hamiltonian circuit is considered and it is shown that this problem is NP-complete.
Book
Graphs, Groups and Surfaces
TL;DR: In this paper, the Cayley Color Graph of a Group of Graphs is presented as an example of a graph automorphism group, which is a group of graph automata.
Related Papers (5)
Linear algorithm for optimal path cover problem on interval graphs
S. Rao Arikati,C. Pandu Rangan +1 more
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
F. T. Boesch,J. F. Gimpel +1 more