2487 search results - page 168 / 498 » Partitions of Graphs into Trees |
136
click to vote
GD
2009
Springer
15 years 8 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
128
Voted
SODA
1994
ACM
15 years 5 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
99
Voted
IWINAC
2005
Springer
15 years 9 months ago
2005
Springer
A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process alge...
163
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
101
Voted
JDA
2006
15 years 3 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...