Sciweavers

731 search results - page 33 / 147
» Reductions to Graph Isomorphism
Sort
View
TCS
2010
13 years 7 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 3 months ago
Deduction as Reduction
Abstract. Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
Dominique Duval
IPL
2008
110views more  IPL 2008»
13 years 8 months ago
Reduction of stochastic parity to stochastic mean-payoff games
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
Krishnendu Chatterjee, Thomas A. Henzinger
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
13 years 8 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas