146 search results - page 5 / 30 » A new characterization of P6-free graphs |
DAM
2007
13 years 7 months ago
2007
: 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...
GECCO
2003
Springer
14 years 20 days ago
2003
Springer
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...
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
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...
DAM
2006
13 years 7 months ago
2006
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...
APAL
2011
13 years 2 months ago
2011
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...