1053 search results - page 1 / 211 » On k-Path Covers and their applications |
CPC
2007
14 years 11 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
142
click to vote
SOICT
2010
14 years 6 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
SIAMDM
2010
14 years 9 months ago
2010
100
click to vote
JSYML
2010
14 years 6 months ago
2010
Abstract. Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introdu...
MP
2010
14 years 9 months ago
2010
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...