1545 search results - page 55 / 309 » On tree congestion of graphs |
ALGORITHMICA
2006
14 years 10 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...