Sciweavers

92 search results - page 2 / 19
» Linked graphs with restricted lengths
Sort
View
119
Voted
CORR
2007
Springer
111views Education» more  CORR 2007»
14 years 9 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
105
Voted
PDP
2005
IEEE
15 years 3 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
IPPS
2000
IEEE
15 years 1 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
ICCAD
2005
IEEE
122views Hardware» more  ICCAD 2005»
15 years 6 months ago
Intrinsic shortest path length: a new, accurate a priori wirelength estimator
A priori wirelength estimation is concerned with predicting various wirelength characteristics before placement. In this work we propose a novel, accurate estimator of net lengths...
Andrew B. Kahng, Sherief Reda
SPAA
2003
ACM
15 years 2 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman