Sciweavers

2294 search results - page 230 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
15 years 3 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
PVLDB
2010
151views more  PVLDB 2010»
15 years 1 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
PADS
2005
ACM
15 years 8 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
WG
1998
Springer
15 years 7 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
IPCCC
2007
IEEE
15 years 9 months ago
Streaming in MANET: Proactive Link Protection and Receiver-Oriented Adaptation
Multimedia streaming applications can significantly boost the value of mobile ad hoc networks (MANET). Live streaming, however, means continuous data delivery, which is a major c...
Toby Xu, Ymg Cai