9532 search results - page 53 / 1907 » Logic, Graphs, and Algorithms |
SODA
2010
ACM
15 years 8 months ago
2010
ACM
SODA
2010
ACM
15 years 8 months ago
2010
ACM
CSL
2005
Springer
15 years 4 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
100
Voted
DIMACS
1996
15 years 13 days ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
110
click to vote
FSTTCS
2008
Springer
15 years 5 days ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...