Sciweavers

731 search results - page 23 / 147
» Reductions to Graph Isomorphism
Sort
View
DM
2006
101views more  DM 2006»
13 years 8 months ago
Cycle double covers and spanning minors II
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
Roland Häggkvist, Klas Markström
CSCLP
2007
Springer
14 years 2 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
AMW
2011
13 years 7 days ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
COMBINATORICS
2006
109views more  COMBINATORICS 2006»
13 years 8 months ago
The Strongly Regular (45, 12, 3, 3) Graphs
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
Kris Coolsaet, Jan Degraer, Edward Spence