Selcuk TOPAL
Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
Communication in Mathematical Modeling and Applications
2016-Cilt: 1 Sayı: 2
42-49
Graph algorithms,
factorization,
matching,
partitioning,
covering and packing,
Paths and cycles.
111
142