2503 search results - page 39 / 501 » A study of 3-arc graphs |
131
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
165
click to vote
DEXAW
1999
IEEE
15 years 10 months ago
1999
IEEE
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
168
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
200
click to vote
COMBINATORICA
2011
14 years 5 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
169
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...