212 search results - page 19 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
68
Voted
SIAMDM
2008
14 years 9 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...