828 search results - page 12 / 166 » Simplicial Powers of Graphs |
CORR
2011
Springer
13 years 10 days ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
AINA
2010
IEEE
14 years 1 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
TACAS
1997
Springer
14 years 22 days ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
IPSN
2009
Springer
14 years 3 months ago
2009
Springer
Camera networks are widely used for tasks such as surveillance, monitoring and tracking. In order to accomplish these tasks, knowledge of localization information such as camera l...
SIGMETRICS
2003
ACM
14 years 1 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...