5100 search results - page 63 / 1020 » The Linear Complexity of a Graph |
113
click to vote
JAPLL
2006
14 years 11 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
101
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
ALENEX
2007
15 years 1 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
ICML
2009
IEEE
16 years 19 days ago
2009
IEEE
