Graph homomorphism

Results: 51



#Item
1CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   STRUCTURE AND COMPLEXITY

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   STRUCTURE AND COMPLEXITY

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2007-10-31 07:12:22
2The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan Hubiˇcka

The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan Hubiˇcka

Add to Reading List

Source URL: www.ucw.cz

Language: English - Date: 2013-11-18 11:40:56
3Part I: Introduction  Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma

Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-09-12 12:52:00
4CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2013-09-27 02:52:02
5A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

Add to Reading List

Source URL: sharif.ir

Language: English - Date: 2013-10-17 07:17:33
6Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif  Fête of Combinatorics and Computer Science

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

Add to Reading List

Source URL: www.ifor.math.ethz.ch

Language: English - Date: 2008-11-18 08:48:31
7QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK

QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-04-01 20:03:12
8Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1  Laboratoire d’Informatique de Nantes-Atlantique (LINA), FR

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 Laboratoire d’Informatique de Nantes-Atlantique (LINA), FR

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:57:15
9Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1

Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2012-06-12 14:31:34
10Takehome Exam Graph II Start: :00 am End: :00 pm  1. Given a graph G whose girth is greater then 10 provide an algorithm that

Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that

Add to Reading List

Source URL: sharif.ir

Language: English - Date: 2016-01-25 15:19:56