311 search results - page 2 / 63 » Graph Classes Between Parity and Distance-hereditary Graphs |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
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...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
TCOM
2011
13 years 2 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
GRAPHICSINTERFACE
2009
13 years 5 months ago
2009
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
LPAR
2004
Springer
14 years 24 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...