4865 search results - page 708 / 973 » The Complexity of Graph Connectivity |
157
click to vote
OPODIS
2007
15 years 6 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
130
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
148
click to vote
IPL
2006
15 years 4 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
141
Voted
SMA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
163
Voted
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...