Sciweavers

146 search results - page 5 / 30
» A new characterization of P6-free graphs
Sort
View
DAM
2007
108views more  DAM 2007»
14 years 9 months ago
3D-interval-filament graphs
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...
Fanica Gavril
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 2 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
ECAI
2000
Springer
15 years 1 months ago
An Ontology Enrichment Method for a Pragmatic Information Extraction System gathering Data on Genetic Interactions
We present in this paper a method to insert new concepts in an existing information extraction system based on a conceptual graph architecture. We use verb patterns as conceptual s...
Claude Roux, Denys Proux, François Rechenma...
DAM
2006
63views more  DAM 2006»
14 years 9 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
APAL
2011
14 years 4 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...