1986 search results - page 11 / 398 » Path Separability of Graphs |
77
Voted
STOC
1990
ACM
15 years 3 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
90
Voted
ERSHOV
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
114
click to vote
SIAMJO
2008
14 years 11 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
91
Voted
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...