Sciweavers

684 search results - page 55 / 137
» A characterization of b-perfect graphs
Sort
View
109
Voted
ICCS
2009
Springer
15 years 8 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...
EMNLP
2006
15 years 3 months ago
Unsupervised Information Extraction Approach Using Graph Mutual Reinforcement
Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual r...
Hany Hassan, Ahmed Hassan, Ossama Emam
GG
2008
Springer
15 years 3 months ago
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
Jérémie Chalopin, Antoni W. Mazurkie...
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 1 months ago
Bounding the Number of Edges in Permutation Graphs
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Peter Keevash, Po-Shen Loh, Benny Sudakov
JGAA
2008
97views more  JGAA 2008»
15 years 1 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta