CORR
2012
Springer
12 years 5 days ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
SAGT
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
JCT
2008
13 years 4 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
COMPLEX
2009
Springer
13 years 8 months ago
2009
Springer
The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht a...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—This paper proposes a novel discrete time secondorder distributed consensus time synchronization (SO-DCTS) algorithm for wireless sensor networks. The consensus properti...