Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM (JACM)
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A Polynomial Solution to the Undirected Two Paths Problem
Journal of the ACM (JACM)
An approach to the k paths problem
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Availability models for underlay aware overlay networks
Proceedings of the second international conference on Distributed event-based systems
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
All normalized anti-monotonic overlap graph measures are bounded
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
We investigate the problem of finding a homeomorphic image of a “pattern” graph H in a larger input graph G. We view this problem as finding specified sets of edge disjoint or node disjoint paths in G. Our main result is a linear time algorithm to determine if there exists a simple cycle containing three given nodes in G; here H is a triangle. No polynomial time algorithm for this problem was previously known. We also discuss a variety of reductions between related versions of this problem and a number of open problems.