9532 search results - page 81 / 1907 » Logic, Graphs, and Algorithms |
ECCC
2000
14 years 11 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
GD
2004
Springer
15 years 4 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
WG
1997
Springer
15 years 3 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
104
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...