Sciweavers

328 search results - page 16 / 66
» Homomorphism bounded classes of graphs
Sort
View
DEDS
2006
111views more  DEDS 2006»
13 years 8 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
CSL
2007
Springer
14 years 2 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
LATIN
2004
Springer
14 years 1 months ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
ISAAC
2010
Springer
268views Algorithms» more  ISAAC 2010»
13 years 6 months ago
On the Intersection of Tolerance and Cocomparability Graphs
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
George B. Mertzios, Shmuel Zaks
WG
2001
Springer
14 years 26 days ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...