Sciweavers

1818 search results - page 100 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
JCT
2007
79views more  JCT 2007»
13 years 8 months ago
Generalization of Stanley's monster reciprocity theorem
By studying the reciprocity property of linear Diophantine systems in light of Malcev-Neumann series, we present in this paper a new approach to and a generalization of Stanley’s...
Guoce Xin
INFORMATICALT
2000
160views more  INFORMATICALT 2000»
13 years 8 months ago
An Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Larisa Stanevichene, Aleksei Vylitok
ENTCS
2002
110views more  ENTCS 2002»
13 years 8 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
DM
1998
56views more  DM 1998»
13 years 8 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
IPL
2010
65views more  IPL 2010»
13 years 7 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez