Sciweavers

1395 search results - page 86 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
CVPR
2007
IEEE
15 years 12 months ago
Layered Graph Match with Graph Editing
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
Liang Lin, Song Chun Zhu, Yongtian Wang
STACS
2010
Springer
15 years 4 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 4 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
COCOON
2003
Springer
15 years 3 months ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
WG
1995
Springer
15 years 1 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...