146 search results - page 9 / 30 » A new characterization of P6-free graphs |
WG
1993
Springer
13 years 11 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
FLAIRS
2008
13 years 9 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
DATE
2003
IEEE
14 years 23 days ago
2003
IEEE
A new method is presented to model symbolically strongly nonlinear circuits, characterized by Piece-Wise Linear (PWL) functions. The method follows the idea of Bokhoven and Leenae...
APWEB
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...