A detachment algorithm for inferring a graph from path frequency

Authors:
Hiroshi Nagamochi
Affiliations:
Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 5
Cited 2

Improved bounds for matroid partition and intersection algorithms

SIAM Journal on Computing
Non-separable detachments of graphs

Journal of Combinatorial Theory Series B
Highly edge-connected detachments of graphs and digraphs

Journal of Graph Theory
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
Inferring a graph from path frequency

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Eulerian detachments with local edge-connectivity

Discrete Applied Mathematics
An efficient algorithm for generating colored outerplanar graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inferring a graph from path frequency has been studied as an important problem which has a potential application to drug design. Given a multiple set g of strings of labels with length at most K, the problem asks to find a vertex-labeled graph G that attains a one-to-one correspondence between g and the set of sequences of labels along all paths of length at most K in G. In this paper, we prove that the problem with K=1 can be formulated as a problem of finding a loopless and connected detachment, based on which an efficient algorithm for solving the problem is derived. Our algorithm also solves the problem with an additional constraint such that every vertex is required to have a specified degree.