Sciweavers

5889 search results - page 454 / 1178
» Graph Layout Problems
Sort
View
CAV
2006
Springer
110views Hardware» more  CAV 2006»
15 years 11 months ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
IJCAI
1989
15 years 8 months ago
Chart Parsing of Flowgraphs
This paper will present a generalisation of chart parsing able to cope with the case where the object being parsed is a particular kind of diagram (a flowgraph) and the grammar is...
Rudi Lutz
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 7 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
DM
2006
108views more  DM 2006»
15 years 7 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
15 years 7 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
Vera Rosta