An exact algorithm for subgraph homeomorphism
نویسندگان
چکیده
منابع مشابه
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm
This paper extends the edge addition planarity algorithm from Boyer and Myrvold to provide a new way of solving the subgraph homeomorphism problem for K2,3, K4, and K3,3. These extensions derive much of their behavior and correctness from the edge addition planarity algorithm, providing an alternative perspective on these subgraph homeomorphism problems based on affinity with planarity rather t...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملEfficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are al...
متن کاملA minimization version of a directed subgraph homeomorphism problem
We consider a special case of the directed subgraph homeomorphism or topologicalminor problem,where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this applicat...
متن کاملThe subgraph homeomorphism problem on reducible flow graphs
We investigate the subgraph homeomorphism problem in which one would like to determine whether a fixed pattern graph is hcmeomorphic to a subgraph of an input graph. We show that for every fixed pattern graph, there is a polynomial-time algorithm to solve the problem if the input graphs are restricted to reducible flow graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2009
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.10.003