830 search results - page 85 / 166 » Route kernels for trees |
117
click to vote
LCN
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper proposes a solution to delivering multicast data reliably not only to/from fixed hosts but also to/from mobile hosts in combined fixed/mobile IP networks, particularl...
104
click to vote
TCAD
2008
14 years 11 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
115
click to vote
ICTAI
2008
IEEE
15 years 6 months ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
123
click to vote
FAW
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...