2017-10-22T17:04:58Z
http://jac.ut.ac.ir/?_action=export&rf=summon&issue=40
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2013
44
1
Constructions of antimagic labelings for some families of regular graphs
Martin
Baca
Mirka
Miller
Oudone
Phanalasy
Andrea
Semanicova-Fenovcıkova
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
antimagic labeling
regular graph
regular complete
multipartite graph
2013
07
01
1
7
http://jac.ut.ac.ir/pdf_345_23116855595822c2b95842e7b3f1e0ea.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2013
44
1
Vertex Equitable Labelings of Transformed Trees
P.
Jeyanthi
A.
Maheswari
vertex equitable labeling
vertex equitable graph
2013
07
01
9
20
http://jac.ut.ac.ir/pdf_346_b7a385d110f5ec4c2d805c82bcf3079e.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2013
44
1
k-equitable mean labeling
P.
Jeyanthi
mean labeling
equitable labeling
equitable mean labeling
2013
07
01
21
30
http://jac.ut.ac.ir/pdf_347_c767d522b6867436b14ee92dc0600323.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2013
44
1
Profiles of covering arrays of strength two
Charles
Colbourn
Jose
Torres-Jimenez
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques can overcome these computational difficulties, but for strength two do not appear to yield a number of tests that is competitive with the fewest known.
covering array
interaction testing
direct product
simulated annealing
2013
12
01
31
59
http://jac.ut.ac.ir/pdf_348_15663cf03a41c7a363532a169150be93.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2013
44
1
Modelling Decision Problems Via Birkhoff Polyhedra
Stephen J.
Gismondi
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours neither in a graph nor its complement and these sets are embedded into disjoint orthogonal spaces as the solution set of a compact formulation. An orthogonal projection of its solution set into the subspace spanned by the Birkhoff polytope is the convex hull of all tours neither in a graph nor its complement. It’s suggested that these techniques might be adaptable for application to linear programming models of network and path problems.
Combinatorial optimization
linear programming
2013
11
01
61
81
http://jac.ut.ac.ir/pdf_349_3fb7c1065f20646ec7ca90750ff4a8c7.html