796 search results - page 60 / 160 » The Anonymous Subgraph Problem |
113
click to vote
BIRD
2007
Springer
15 years 8 months ago
2007
Springer
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
125
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
116
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
124
click to vote
WG
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
136
Voted
ICDM
2010
IEEE
15 years 14 days ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...