3008 search results - page 118 / 602 » Independence in connected graphs |
201
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
150
click to vote
ISCC
2006
IEEE
16 years 12 days ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
158
click to vote
JCT
2006
15 years 6 months ago
2006
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
170
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
173
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...