Fetching the paper…
Reading the bibliography…
We present a novel neural architecture to solve graph optimization problems where the solution consists of arbitrary node labels, allowing us to solve hard problems like graph coloring.
Coloring big graphs with alphagozero
Huang, J., Patwary, M. M. A., and Diamos, G. F · 1902
Earlier work this paper cites.
Lemos, H., Prates, M. O. R., Avelar, P. H. C., and Lamb, L. C · 1903
Earlier work this paper cites.
An efficient graph convolutional network technique for the travelling salesman problem
Joshi, C. K., Laurent, T., and Bresson, X · 1906
Earlier work this paper cites.
Solution of a large-scale traveling-salesman problem
Dantzig, G. B., Fulkerson, D. R., and Johnson, S. M · 1954
Earlier work this paper cites.
On the evolution of random graphs
Erdős, P. and Rényi, A · 1960
Earlier work this paper cites.
An efficient heuristic procedure for partitioning graphs
Kernighan, B. W. and Lin, S · 1970
Earlier work this paper cites.
Reducibility among combinatorial problems
Karp, R · 1972
Earlier work this paper cites.
On the metric dimension of a graph
Harary, F. and Melter, R. A · 1976
Earlier work this paper cites.
Finding a maximum independent set
Tarjan, R. E. and Trojanowski, A. E · 1977
Earlier work this paper cites.
New methods to color vertices of a graph
Brélaz, D · 1979
Earlier work this paper cites.
Register allocation & spilling via graph coloring
Chaitin, G. J · 1982
Earlier work this paper cites.
Smallest-last ordering and clustering and graph coloring algorithms
Matula, D. W. and Beck, L. L · 1983
Earlier work this paper cites.
On the evolution of random graphs
Erdős, P. and Rényi, A · 1984
Earlier work this paper cites.
Combinatorial Optimization: Algorithms and Complexity , volume 32
Papadimitriou, C. and Steiglitz, K · 1984
Earlier work this paper cites.
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
Cowen, L. J., Cowen, R., and Woodall, D. R · 1986
Earlier work this paper cites.
Algorithms for maximum independent sets
Robson, J. M · 1986
Earlier work this paper cites.
Computers and Intractability; A Guide to the Theory of NP-Completeness
Garey, M. R. and Johnson, D. S · 1990
Earlier work this paper cites.
Bibliography on domination in graphs and some basic definitions of domination parameters
Hedetniemi, S. T. and Laskar, R. C · 1990
Earlier work this paper cites.
Graph Coloring Problems
Jensen, T., Jensen, T., and Toft, B · 1995
Earlier work this paper cites.
A new approach to the minimum cut problem
Karger, D. R. and Stein, C · 1996
Cited alongside, same era.
On approximating the longest path in a graph
Karger, D. R., Motwani, R., and Ramkumar, G. D. S · 1997
Cited alongside, same era.
Collective dynamics of ’small-world’ networks
Watts, D. J. and Strogatz, S. H · 1998
Cited alongside, same era.
URL https://mat.tepper.cmu.edu/COLOR02/
Computational symposium on graph coloring and generalizations (COLOR02), Ithaca, NY, 7-8 September 2002, 2002 · 2002
Cited alongside, same era.
Statistical mechanics of complex networks
Albert, R. and Barabási, A.-L · 2002
Cited alongside, same era.
An efficient branch-and-bound algorithm for finding a maximum clique
Tomita, E. and Seki, T · 2003
Cited alongside, same era.
Batch normalization: Accelerating deep network training by reducing internal covariate shift
Ioffe, S. and Szegedy, C · 2015
Later among the works it cites.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J · 2015
Later among the works it cites.
Deep residual learning for image recognition
He, K., Zhang, X., Ren, S., and Sun, J · 2016
Later among the works it cites.
Neural combinatorial optimization with reinforcement learning
Bello, I., Pham, H., Le, Q. V., Norouzi, M., and Bengio, S · 2017
Later among the works it cites.
Fully dynamic approximate maximum matching and minimum vertex cover in O (log 3 {}^{\mbox{3}} n ) worst case update time
Bhattacharya, S., Henzinger, M., and Nanongkai, D · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kernelization algorithms for the vertex cover problem: Theory and experiments
Abu-khzam, F., Collins, R., Fellows, M., Langston, M., Suters, W., and Symons, C · 2004
Cited alongside, same era.
Graph colouring problems and their applications in scheduling
Marx, D · 2004
Cited alongside, same era.
A generalized algorithm for graph-coloring register allocation
Smith, M. D., Ramsey, N., and Holloway, G. H · 2004
Cited alongside, same era.
Discovering treewidth
Bodlaender, H. L · 2005
Cited alongside, same era.
Combining reinforcement learning and constraint programming for combinatorial optimization
Cappart, Q., Moisan, T., Rousseau, L., Prémont-Schwarz, I., and Ciré, A. A · 2006
Cited alongside, same era.
A better list heuristic for vertex cover
Delbot, F. and Laforest, C · 2008
Cited alongside, same era.
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., and Song, L · 2017
Later among the works it cites.
Application of minimum vertex cover for keyword – based text summarization process
ul Islam, A. and Kalita, B · 2017
Later among the works it cites.
Attention is all you need
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., and Polosukhin, I · 2017
Later among the works it cites.
Combinatorial optimization with graph convolutional networks and guided tree search
Li, Z., Chen, Q., and Koltun, V · 2018
Later among the works it cites.
Reinforcement Learning: An Introduction
Sutton, R. S. and Barto, A. G · 2018
Later among the works it cites.
Graph attention networks
Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., and Bengio, Y · 2018
Later among the works it cites.
Attention, learn to solve routing problems!
Kool, W., van Hoof, H., and Welling, M · 2019
Later among the works it cites.
Attention models in graphs: A survey
Lee, J. B., Rossi, R. A., Kim, S., Ahmed, N. K., and Koh, E · 2019
Later among the works it cites.
Exploratory combinatorial optimization with reinforcement learning
Barrett, T. D., Clements, W. R., Foerster, J. N., and Lvovsky, A · 2020
Later among the works it cites.
Learning to solve combinatorial optimization problems on real-world graphs in linear time
Drori, I., Kharkar, A., Sickinger, W. R., Kates, B., Ma, Q., Ge, S., Dolev, E., Dietrich, B., Williamson, D. P., and Udell, M · 2020
Later among the works it cites.
A massively parallel algorithm for minimum weight vertex cover
Ghaffari, M., Jin, C., and Nilis, D · 2020
Later among the works it cites.
Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning
Ma, Q., Ge, S., He, D., Thaker, D., and Drori, I · 2020
Later among the works it cites.
GCOMB: learning budget-constrained combinatorial algorithms over billion-sized graphs
Manchanda, S., Mittal, A., Dhawan, A., Medya, S., Ranu, S., and Singh, A · 2020
Later among the works it cites.