HERA Memo 24 March 23, 2017 Omnical Degeneracy Removal Josh Dillon and Aaron Parsons 1

Source URL: reionization.org

Enumeration of All Extreme Equilibria of Bimatrix Games with Integer Pivoting and Improved Degeneracy Check∗ Gabriel D. Rosenberg Department of Mathematics, London School of Economics and Political Science Houghton St,

Source URL: www.cdam.lse.ac.uk

Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Source URL: www.cs.uwm.edu

• Graph theory
• Graph coloring
• Matching
• Planar graphs
• Line graph
• Claw-free graph
• Planarization
• Treewidth
• Acyclic coloring
• Graph minor
• Degeneracy

An In-Depth Study of Stochastic Kronecker Graphs C.Seshadhri, Ali Pinar, and Tamara Kolda Sandia National Laboratories Abstract—Graph analysis is playing an increasingly important role in science and industry. Due to n

Source URL: www.sandia.gov

• Graph theory
• Mathematics
• Mathematical analysis
• Degeneracy
• Graph
• Connectivity
• Log-normal distribution
• Degree
• Vertex
• Normal distribution
• Random graph

The adaptable choosability number grows with the choosability number Michael Molloya,1 , Giovanna Throna a University of Toronto, Department of Computer Science, 10 King’s College Road,

Source URL: www.cs.toronto.edu

• Graph theory
• Graph coloring
• List coloring
• Edge coloring
• Degeneracy
• Probabilistic method
• Total coloring
• Incidence coloring

Discovering dense subgraphs and understanding their relations is important. Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been shown to be effective to locate many dense subgraphs. However, constru

Source URL: mmds-data.org

• Graph theory
• Mathematics
• Degeneracy
• Neighbourhood
• Algorithm

Sets that are connected in two random graphs Michael Molloy∗ August 17, 2012 Abstract We consider two random graphs G1 , G2 , both on the same vertex set. We ask whether there

Source URL: www.cs.toronto.edu

• Graph connectivity
• Tree
• Line graph
• Connected component
• Degeneracy

k-core decomposition: a tool for the visualization of large scale networks Ignacio Alvarez-Hamelina , Luca Dall’Astaa , Alain Barrata and Alessandro Vespignanib a LPT (UMR du CNRS 8627), Universit´e de Paris-Sud, 914

Source URL: arxiv.org

• Graph theory
• Degeneracy
• Vertex
• Connectivity
• Graph
• Centrality
• Ear decomposition
• Directed graph
• Neighbourhood
• Degree
• HCS clustering algorithm
• Clique percolation method

Spectral Graph Theory Lecture 9 Tutte’s Theorem Daniel A. Spielman

Source URL: www.cs.yale.edu

• Planar graphs
• Graph operations
• Graph theory
• Edge contraction
• Graph minor
• Tree
• Vertex
• Degeneracy
• Graph
• Tutte embedding
• Line graph

Discovering dense subgraphs and understanding their relations is important. Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been shown to be effective to locate many dense subgraphs. However, constru

Source URL: mmds-data.org

• Degeneracy
• Neighbourhood
• Algorithm