463 search results - page 25 / 93 » The Most Reliable Subgraph Problem |
108
Voted
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
135
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
SADFE
2005
IEEE
15 years 7 months ago
2005
IEEE
Today log traces are widely used to identify and prevent violations of corporate information systems. The most recent logging trend is to manage most level 3 ISO/OSI traffic via p...
DAM
2008
15 years 1 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
110
click to vote
ICMLA
2009
14 years 11 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...