446 search results - page 48 / 90 » A Combinatorial Theorem for Trees |
155
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
157
click to vote
INFOCOM
2009
IEEE
16 years 19 days ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
155
Voted
ECCV
1998
Springer
16 years 7 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
126
click to vote
ACS
2008
15 years 6 months ago
2008
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
163
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...