3958 search results - page 484 / 792 » Dynamic Graph Algorithms with Applications |
183
click to vote
ASPDAC
2005
ACM
16 years 6 days 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...
166
click to vote
CIDM
2007
IEEE
15 years 10 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 ...
181
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
151
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
192
click to vote
IWPEC
2004
Springer
16 years 1 min ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...