4679 search results - page 2 / 936 » Modeling When Connections Are the Problem |
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
DBKDA
2009
IEEE
13 years 8 months ago
2009
IEEE
Most database applications are designed according the ANSI/SPARC architecture. When it is used, a large amount of semantics of data may be lost during the transformation from the ...
ICML
2003
IEEE
14 years 5 months ago
2003
IEEE
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
ENDM
2010
13 years 4 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
TRANSCI
1998
13 years 4 months ago
1998
