The following pages link to (Q4319638):
Displaying 10 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Verification of graph grammars using a logical approach (Q436370) (← links)
- Techniques for pipelined broadcast on Ethernet switched clusters (Q436793) (← links)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Synchronization in federation community networks (Q666030) (← links)
- On single courier problem (Q941049) (← links)
- Performance analysis and functional verification of the stop-and-wait protocol in HOL (Q1040781) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
