5889 search results - page 824 / 1178 » Graph Layout Problems |
172
click to vote
ENTCS
2002
15 years 6 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
180
click to vote
DAM
1999
15 years 6 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
206
click to vote
NETWORKS
2010
15 years 5 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
202
click to vote
RSA
2010
15 years 5 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
196
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...