5889 search results - page 963 / 1178 » Graph Layout Problems |
151
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
154
click to vote
ISAAC
1995
Springer
15 years 10 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
189
click to vote
RTSS
1995
IEEE
15 years 10 months ago
1995
IEEE
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
178
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
184
click to vote
IAT
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...