5889 search results - page 334 / 1178 » Graph Layout Problems |
159
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
192
click to vote
PVLDB
2008
15 years 6 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
156
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
194
Voted
ALGORITHMICA
2007
15 years 6 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
226
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...