219 search results - page 23 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
112
click to vote
STACS
1999
Springer
15 years 5 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
108
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
127
click to vote
FCT
1997
Springer
15 years 5 months ago
1997
Springer
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
INFOCOM
1990
IEEE
15 years 5 months ago
1990
IEEE
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
104
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...