1162 search results - page 119 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...