Sciweavers

3204 search results - page 87 / 641
» The Alcuin Number of a Graph
Sort
View
CORR
2011
Springer
128views Education» more  CORR 2011»
13 years 3 months ago
LIFO-search on digraphs: A searching game for cycle-rank
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...
Paul Hunter
COLING
2010
13 years 3 months ago
A Global Relaxation Labeling Approach to Coreference Resolution
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference Resolution in Multiple Languages". RelaxCor is a constraint-based grap...
Emili Sapena, Lluís Padró, Jordi Tur...
ENDM
2007
111views more  ENDM 2007»
13 years 8 months ago
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Arnaud Pêcher, Xuding Zhu
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 8 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
DAM
2010
132views more  DAM 2010»
13 years 8 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...