Sciweavers

311 search results - page 13 / 63
» Graph Classes Between Parity and Distance-hereditary Graphs
Sort
View
ASWEC
2008
IEEE
14 years 1 months ago
An Exploration of Power-Law in Use-Relation of Java Software Systems
A software component graph, where a node represents a component and an edge represents a use-relation between components, is widely used for analysis methods of software engineeri...
Makoto Ichii, Makoto Matsushita, Katsuro Inoue
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
14 years 1 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
13 years 5 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
COLT
2005
Springer
14 years 1 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivated...
Mikhail Belkin, Partha Niyogi
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
13 years 11 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi