1963 search results - page 38 / 393 » The Maximum Solution Problem on Graphs |
IH
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
WG
2001
Springer
14 years 1 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
WG
2001
Springer
14 years 1 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
ESANN
2007
13 years 10 months ago
2007
Abstract. Canonical Correlation Analysis(CCA) is a useful tool to discover relationship between different sources of information represented by vectors. The solution of the underl...
STACS
2001
Springer
14 years 1 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...