Sciweavers

483 search results - page 44 / 97
» On perfectness of sums of graphs
Sort
View
128
Voted
ICALP
2009
Springer
15 years 11 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
110
Voted
COCOON
2007
Springer
15 years 5 months ago
On the Number of Cycles in Planar Graphs
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
Kevin Buchin, Christian Knauer, Klaus Kriegel, And...
74
Voted
DAM
2006
116views more  DAM 2006»
14 years 11 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
88
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 8 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...