Sciweavers

251 search results - page 5 / 51
» Graph Isomorphism is in SPP
Sort
View
MFCS
2009
Springer
14 years 13 hour ago
Representing Groups on Graphs
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
Sagarmoy Dutta, Piyush P. Kurur
ICDAR
2009
IEEE
13 years 5 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
GC
2007
Springer
13 years 7 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen
JUCS
2008
123views more  JUCS 2008»
13 years 7 months ago
Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
Ricardo Santos, Rodolfo Azevedo, Guido Araujo
DM
2002
89views more  DM 2002»
13 years 7 months ago
Fibrations of graphs
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This pap...
Paolo Boldi, Sebastiano Vigna