Sciweavers

2612 search results - page 417 / 523
» Switching Graphs and Their Complexity
Sort
View
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 2 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
BPM
2006
Springer
166views Business» more  BPM 2006»
14 years 1 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
CATS
2008
13 years 11 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 11 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
BIRTHDAY
2010
Springer
13 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman