Optimizing concurrency under Scheduling by Edge Reversal

[1]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[2]  Fahad Panolan,et al.  Long directed (s, t)-path: FPT algorithm , 2018, Inf. Process. Lett..

[3]  Jose D. Fernández,et al.  AI Methods in Algorithmic Composition: A Comprehensive Survey , 2013, J. Artif. Intell. Res..

[4]  Paul D. Seymour,et al.  Recognizing Berge Graphs , 2005, Comb..

[5]  Massimo De Gregorio,et al.  A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load , 2004, OPODIS.

[6]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[7]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[8]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[9]  Kazuhisa Makino,et al.  Parameterized Edge Hamiltonicity , 2018, Discret. Appl. Math..

[10]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[11]  Shmuel Zaks,et al.  A lower bound on the period length of a distributed scheduler , 2005, Algorithmica.

[12]  Petr A. Golovach,et al.  Clique-width: on the price of generality , 2009, SODA.

[13]  Alexandre Salles da Cunha,et al.  A New Formulation and Computational Results for the Simple Cycle Problem , 2013, Electron. Notes Discret. Math..

[14]  L. Lovász.  Three short proofs in graph theory , 1975 .

[15]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[16]  Eli Gafni,et al.  Concurrency in heavily loaded neighborhood-constrained systems , 1989, ICDCS.

[17]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[18]  Felix Mora-Camino,et al.  Distributed control of job-shop systems via edge reversal dynamics for automated guided vehicles , 2012 .

[19]  Edsger W. Dijkstra,et al.  Hierarchical ordering of sequential processes , 1971, Acta Informatica.

[20]  Zsolt Tuza,et al.  On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs , 1999, J. Algorithms.

[21]  Man-Kwan Shan,et al.  Algorithmic compositions based on discovered musical patterns , 2009, Multimedia Tools and Applications.

[22]  Nelson Maculan,et al.  A Distributed Dynamics for WebGraph Decontamination , 2010, ISoLA.

[23]  Jose David Fernández-Rodríguez,et al.  AI Methods in Algorithmic Composition: A Comprehensive Survey , 2013 .

[24]  M. S. Krishnamoorthy,et al.  An NP-hard problem in bipartite graphs , 1975, SIGA.

[25]  Sergio Rajsbaum,et al.  Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version) , 1991, WDAG.

[26]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[27]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[28]  Saul Stahl,et al.  The multichromatic numbers of some Kneser graphs , 1998, Discret. Math..

[29]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[30]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[31]  Martin Charles Golumbic,et al.  Algorithmic Graph Theory and Its Applications , 2005 .