Sciweavers

1736 search results - page 11 / 348
» The rank-width of Directed Graphs
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 10 months ago
Hardness of cut problems in directed graphs
Julia Chuzhoy, Sanjeev Khanna
170
Voted
DISOPT
2011
240views Education» more  DISOPT 2011»
14 years 5 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
TIT
2010
98views Education» more  TIT 2010»
14 years 4 months ago
Pairwise intersession network coding on directed networks
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
Chih-Chun Wang, Ness B. Shroff
95
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Ra...