684 search results - page 19 / 137 » On embedding well-separable graphs |
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
SYNASC
2006
IEEE
15 years 3 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
73
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
62
Voted
CODES
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper describes the functional specification and verification portions of El Greco, a system for high-level, heterogeneous functional specification, efficient compiled si...