2487 search results - page 236 / 498 » Partitions of Graphs into Trees |
120
click to vote
ENTCS
2008
15 years 4 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
149
click to vote
CC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
133
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
143
click to vote
CPC
2006
15 years 4 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
118
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...