Sciweavers

101 search results - page 6 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
GG
2004
Springer
14 years 22 days ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
ESWA
2008
131views more  ESWA 2008»
13 years 7 months ago
Classification of weld flaws with imbalanced class data
This paper presents research results of our investigation of the imbalanced data problem in the classification of different types of weld flaws, a multi-class classification probl...
T. Warren Liao
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 8 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
RTA
2010
Springer
13 years 9 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
DAM
2010
167views more  DAM 2010»
13 years 7 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma