463 search results - page 18 / 93 » The Most Reliable Subgraph Problem |
106
Voted
JUCS
2010
14 years 8 months ago
2010
: One of the most important use-cases of Trusted Computing is Remote Attestation. It allows platforms to get a trustworthy proof of the loaded software and current configuration of...
145
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
139
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
121
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
116
click to vote
CIDM
2009
IEEE
15 years 5 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...