University of TehranJournal of Algorithms and Computation2776-2476471201606013-difference cordial labeling of some cycle related graphs110enR. PonrajDepartment of Mathematics, Sri Paramakalyani College,Alwarkurichi-627 412, IndiaM. Maria AdaickalamDepartment of Mathematics, Kamarajar Government Arts College, Surandai-627859, India20151020http://jac.ut.ac.ir/pdf_361_2058a8520b6be55a66b6d88cf1ff676f.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160601A Survey on Complexity of Integrity Parameter1119enMahmood ShabankhahUniversity of Tehran, College of Engineering, Department of Engineering Science20150510http://jac.ut.ac.ir/pdf_365_cbdf47ab50798add111a36ddb52c43be.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160602On Generalized Weak Structures2126enR. JamunaraniResearch Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, IndiaP. JeyanthiResearch Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, IndiaT. NoiriShiokota-cho Hinagu, Yatsushiro-shi kumamoto-ken, 869-5142 Japan20151201http://jac.ut.ac.ir/pdf_366_9e73174a81cdfca4a7d711bd908dca2a.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160601Online Scheduling of Jobs for D-benevolent instances On Identical Machines2736enI. MohammadiUniversity of Tehran, Department of Algorithms and Computation.Dara MoazzamiUniversity of Tehran, College of Engineering, Faculty of Engineering Science20150320http://jac.ut.ac.ir/pdf_367_f66b689563341f19f8abe5d5de8da400.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160601Mixed cycle-E-super magic decomposition of complete bipartite graphs3752enG. MarimuthuDepartment of Mathematics, The Madura College, Madurai -625 011, Tamilnadu, IndiaS. Stalin KumarDepartment of Mathematics, The American College, Madurai - 625 002, Tamilnadu,India20151020http://jac.ut.ac.ir/pdf_368_5f537569fcfee7d3d929abdef859d33f.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160319Heuristic and exact algorithms for Generalized Bin Covering Problem5362enS. JabariUniversity of Tehran, Department of Algorithms and Computation.Dara MoazzamiUniversity of Tehran, College of Engineering, Faculty of Engineering ScienceA. GhodousianUniversity of Tehran, College of Engineering, Faculty of Engineering Science20151020http://jac.ut.ac.ir/pdf_370_ead5452fc8136548321a56c8bfa77888.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160610Zarankiewicz Numbers and Bipartite Ramsey Numbers6378enAlex F. CollinsRochester Institute of Technology, School of Mathematical Sciences, Rochester, NY 14623Alexander W. N. RiasanovskyUniversity of Pennsylvania, Department of Mathematics, Philadelphia, PA 19104, USAJohn C. WallaceTrinity College, Department of Mathematics, Hartford, CT 06106, USAStanis law P. RadziszowskiRochester Institute of Technology, Department of Computer Science, Rochester, NY 1462320160208http://jac.ut.ac.ir/pdf_377_0d5d2a7f40f78dfe0e529df98f3049dd.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160401Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model7992enMahdi HeidariDepartment of Algorithms and Computation, University of TehranAli GolshaniDepartment of Algorithms and Computation, University of TehranD. MoazzamiUniversity of Tehran, College of Engineering, Faculty of Enginering ScienceAli MoeiniUniversity of Tehran, College of Engineering, Faculty of Enginering Science20150630http://jac.ut.ac.ir/pdf_378_cf76fdb4b0ab6812faebfef5f611d4d6.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160324A Cellular Automaton Based Algorithm for Mobile Sensor Gathering9399enS. SaadatmandUniversity of New South Wales, College of Engineering, Department of Computer Science, Sydney, Australia.D. MoazzamiUniversity of Tehran, College of Engineering, Faculty of Engineering ScienceA. MoeiniUniversity of Tehran, College of Engineering, Faculty of Engineering Science20150320http://jac.ut.ac.ir/pdf_381_1aea8cc39be37b7a09b0e9f9f6aa0812.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160401A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations101117enSamira RezaeiDepartment of Algorithms and Computation, University of TehranAmin GhodousianUniversity of Tehran, College of Engineering, Faculty of Engineering Science20150530http://jac.ut.ac.ir/pdf_383_b3e9bb57657183c34d60a4df9921c654.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160501The edge tenacity of a split graph119125enBahareh Bafandeh MayvanDepartment of Computer Engineering, Ferdowsi University of Mashhad20150630 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split graph with minimum vertex degree δ(G) we prove that if δ(G)≥|E(G)|/[|V(G)|-1] then its edge-tenacity is |E(G)|/[|V(G)|-1] .]]>http://jac.ut.ac.ir/pdf_384_79987a74d7a89e4dc593ea40d6df17ea.htmlUniversity of TehranJournal of Algorithms and Computation2776-247647120160521Minimum Tenacity of Toroidal graphs127135enHamid Doost HosseiniUniversity of Tehran, College of Engineering, School of Civil Engineering20150430http://jac.ut.ac.ir/pdf_385_c8ea937acc51627d689d94f03167568d.html