2612 search results - page 171 / 523 » Switching Graphs and Their Complexity |
129
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
318
click to vote
PAMI
2010
15 years 2 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
136
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
123
Voted
SEMCO
2007
IEEE
15 years 10 months ago
2007
IEEE
Model-driven development depends on good initial models. Creating these models by hand is a challenging task, because of complex specification documents and change requests. We p...
208
click to vote
GMP
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...