Results 21 to 30 of about 1,883 (72)
On the complexity of the balanced vertex ordering problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Jan Kára, Jan Kratochvil, David R. Wood
doaj +1 more source
On the tileability of polygons with colored dominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Chris Worman, Boting Yang
doaj +1 more source
Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Philippe Dumas +2 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Van Bang Le, H. N. Ridder
doaj +1 more source
"Trivializing'' generalizations of some Izergin-Korepin-type determinants [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Combinatorics
Tewodros Amdeberhan, Doron Zeilberger
doaj +1 more source
Note on the weighted internal path length of b-ary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Ludger Rüschendorf, Eva-Maria Schopp
doaj +1 more source
Exponential bounds and tails for additive random recursive sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Ludger Rüschendorf, Eva-Maria Schopp
doaj +1 more source
On the kth Eigenvalues of Trees with Perfect Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
An Chang, Wai Chee Shiu
doaj +1 more source
The \v Cerný conjecture for aperiodic automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable.
A. N. Trahtman
doaj +1 more source
Extremal properties of flood-filling games [PDF]
, 2019 The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about ...
Meeks, Kitty, Vu, Dominik K.
core +2 more sources