• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,388
Next 10 →

Network Coding in Undirected Networks

by Zongpeng Li, Baochun Li , 2004
"... Recent work in network coding shows that, it is necessary to consider both the routing and coding strategies to achieve optimal throughput of information transmission in data networks. So far, most research on network coding has focused on the model of directed networks, where each communication li ..."
Abstract - Cited by 79 (18 self) - Add to MetaCart
link has a fixed direction. In this paper, we study the benefits of network coding in undirected networks, where each communication link is bidirectional. Our theoretical results show that, for a single unicast or broadcast session, there are no improvements with respect to throughput due to network

Influence Maximization in Undirected Networks

by Sanjeev Khanna, Brendan Lucier
"... We consider the problem of finding a set of k vertices of maximal total influence in a given undirected network, under the independent cascade (IC) model of influence spread. It is known that influence is submodular in the IC model, and hence a greedy algorithm achieves a (1 − 1/e) approximation to ..."
Abstract - Add to MetaCart
We consider the problem of finding a set of k vertices of maximal total influence in a given undirected network, under the independent cascade (IC) model of influence spread. It is known that influence is submodular in the IC model, and hence a greedy algorithm achieves a (1 − 1/e) approximation

On the Capacity Bounds of Undirected Networks

by Ali Al-bashabsheh, Abbas Yongacoglu , 804
"... Abstract — In this work we improve on the bounds presented in [1] for network coding gain in the undirected case. A tightened bound for the undirected multicast problem with three terminals is derived. An interesting result shows that with fractional routing, routing throughput can achieve at least ..."
Abstract - Add to MetaCart
Abstract — In this work we improve on the bounds presented in [1] for network coding gain in the undirected case. A tightened bound for the undirected multicast problem with three terminals is derived. An interesting result shows that with fractional routing, routing throughput can achieve at least

Mapping semantic networks to undirected networks

by Marko A. Rodriguez - International Journal of Applied Mathematics and Computer Science , 2008
"... Abstract—There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled network). The edge label in the semantic network is represented as a topological feature of the directed network. Also, t ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
, there exists an injective function that maps a directed network to an undirected network (i.e. an undirected unlabeled network). The edge directionality in the directed network is represented as a topological feature of the undirected network. Through function composition, there exists an injective function

The Irreducible Spine(s) of Undirected Networks

by John L. Pfaltz
"... Abstract. Using closure and neighborhood concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its “spine”. The chordless cycles which comprise this irreducible core effectively characterize the connectivity structure of the network as ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Using closure and neighborhood concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its “spine”. The chordless cycles which comprise this irreducible core effectively characterize the connectivity structure of the network

DECENTRALIZED DETECTION IN UNDIRECTED NETWORK TOPOLOGIES

by O. Patrick Kreidl, Alan S. Willsky
"... Consider the well-studied decentralized Bayesian detection problem with the twist of an undirected network topology, each edge representing a bidirectional (and perhaps unreliable) finite-rate communication link between two distributed sensor nodes. Every node operates in parallel, processing any pa ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Consider the well-studied decentralized Bayesian detection problem with the twist of an undirected network topology, each edge representing a bidirectional (and perhaps unreliable) finite-rate communication link between two distributed sensor nodes. Every node operates in parallel, processing any

On the price of stability for undirected network design

by George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee , 2010
"... We continue the study of the effects of selfish behavior in the network design problem. We provide new bounds for the price of stability for network design with fair cost allocation for undirected graphs. We consider the most general case, for which the best known upper bound is the Harmonic number ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
We continue the study of the effects of selfish behavior in the network design problem. We provide new bounds for the price of stability for network design with fair cost allocation for undirected graphs. We consider the most general case, for which the best known upper bound is the Harmonic number

Minimum Cut Bases in Undirected Networks

by Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne Schwahn , 2007
"... ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract not found

Nonlinear Synchronization on Connected Undirected Networks

by S. Orange , 2011
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Computing All Small Cuts in an Undirected Network

by Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki - SIAM Journal on Discrete Mathematics , 1994
"... : Let (N ) denote the weight of a minimum cut in an edge-weighted undirected network N , and n and m denote the numbers of vertices and edges, respectively. It is known that O(n 2k ) is an upper bound on the number of cuts with weights less than k(N ), where k 1 is a given constant. This paper rs ..."
Abstract - Cited by 33 (3 self) - Add to MetaCart
: Let (N ) denote the weight of a minimum cut in an edge-weighted undirected network N , and n and m denote the numbers of vertices and edges, respectively. It is known that O(n 2k ) is an upper bound on the number of cuts with weights less than k(N ), where k 1 is a given constant. This paper
Next 10 →
Results 1 - 10 of 1,388
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University