251 search results - page 29 / 51 » The Graphs with All Subgraphs T-Perfect |
WG
2009
Springer
14 years 2 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
ESANN
2003
13 years 9 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
DM
2006
13 years 7 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...