Sciweavers

MOBIHOC
2012
ACM
12 years 1 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
SIGMETRICS
2011
ACM
139views Hardware» more  SIGMETRICS 2011»
13 years 2 months ago
Slick packets
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
Giang T. K. Nguyen, Rachit Agarwal, Junda Liu, Mat...
ICALP
2011
Springer
13 years 3 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
DASFAA
2011
IEEE
177views Database» more  DASFAA 2011»
13 years 3 months ago
Optimizing Incremental Maintenance of Minimal Bisimulation of Cyclic Graphs
Abstract. Graph-structured databases have numerous recent applications including the Semantic Web, biological databases and XML, among many others. In this paper, we study the main...
Jintian Deng, Byron Choi, Jianliang Xu, Sourav S. ...
TCBB
2011
13 years 6 months ago
Comparison of Galled Trees
Galled trees, directed acyclic graphs that model evolutionary histories with isolated hybridization events, have become very popular due to both their biological significance and ...
Gabriel Cardona, Mercè Llabrés, Fran...
IEICET
2011
13 years 6 months ago
Minimum Spanning Tree Problem with Label Selection
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Akio Fujiyoshi, Masakazu Suzuki
ECCC
2010
143views more  ECCC 2010»
13 years 9 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
ALGORITHMICA
2002
116views more  ALGORITHMICA 2002»
13 years 11 months ago
Budget Management with Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastav...
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 11 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
EACL
1989
ACL Anthology
14 years 20 days ago
Extended Graph Unification
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
Allan Ramsay