Sciweavers

796 search results - page 7 / 160
» The Anonymous Subgraph Problem
Sort
View
STOC
1991
ACM
105views Algorithms» more  STOC 1991»
15 years 3 months ago
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
Hristo Djidjev, John H. Reif
111
Voted
CPAIOR
2010
Springer
15 years 4 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
14 years 9 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
FPL
2000
Springer
103views Hardware» more  FPL 2000»
15 years 3 months ago
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
Shuichi Ichikawa, Hidemitsu Saito, Lerdtanaseangth...
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 5 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia