4865 search results - page 318 / 973 » The Complexity of Graph Connectivity |
166
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
191
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
168
Voted
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
185
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
148
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...