668 search results - page 57 / 134 » Algorithmics and Applications of Tree and Graph Searching |
103
click to vote
CIDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
133
Voted
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
135
click to vote
ECCC
2010
14 years 12 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
114
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
126
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...