715 search results - page 61 / 143 » On graphs with subgraphs having large independence numbers |
106
click to vote
CMSB
2006
Springer
15 years 5 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
101
click to vote
GC
2007
Springer
15 years 1 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
SAGA
2007
Springer
15 years 7 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
95
Voted
CCS
2007
ACM
15 years 7 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
119
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...