463 search results - page 28 / 93 » The Most Reliable Subgraph Problem |
144
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
131
click to vote
ADC
2005
Springer
15 years 7 months ago
2005
Springer
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...
108
click to vote
GLVLSI
2010
IEEE
15 years 7 months ago
2010
IEEE
NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture leve...
104
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
134
click to vote
TALG
2008
15 years 1 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...