5889 search results - page 186 / 1178 » Graph Layout Problems |
189
click to vote
MFCS
2010
Springer
15 years 4 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...
185
Voted
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
167
click to vote
AAIM
2007
Springer
16 years 17 days ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
143
click to vote
WG
2009
Springer
16 years 29 days ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
160
Voted
ICDAR
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, we propose a fast method for determining the human reading order of the layout elements of a document page. The proposal includes a computationally tractable optimi...