Sciweavers

1756 search results - page 108 / 352
» Directed scale-free graphs
Sort
View
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 2 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
PPAM
2007
Springer
14 years 2 months ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
DIS
2004
Springer
14 years 1 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
GG
2004
Springer
14 years 1 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink
ICPR
2000
IEEE
14 years 14 days ago
A Graph-Based Global Registration for 2D Mosaics
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
Eun-Young Kang, Isaac Cohen, Gérard G. Medi...