Sciweavers

396 search results - page 35 / 80
» Exact Algorithms for Graph Homomorphisms
Sort
View
ICPR
2010
IEEE
14 years 2 months ago
Live Cell Segmentation in Fluorescence Microscopy via Graph Cut
We propose a novel Markovian segmentation model which takes into account edge information. By construction, the model uses only pairwise interactions and its energy is submodula...
Milán Leskó, Zoltan Kato, Antal Nagy, Imre Gombo...
CSCLP
2007
Springer
14 years 3 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
FSTTCS
2007
Springer
14 years 3 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 3 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
FOCS
1994
IEEE
14 years 1 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim