Smallest-last ordering and clustering and graph coloring algorithms

  title={Smallest-last ordering and clustering and graph coloring algorithms},
  author={David W. Matula and Leland L. Beck},
  journal={J. ACM},
Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected subgraphs maxunal with respect to their minimum degree can be determined in O(I EI + I VI) time and 21El + O(I VI) space It is further noted that the smallest-last graph coloring algonthrn can be unplemented in O(I E I + I V[) tune, and particularly effective aspects of the resulting coloring are discussed. 

Figures from this paper

On vertex orderings and the stability number in triangle-free graphs
Lower Bounds for On-line Graph Coloring Magn us M. Halld orsson
It is shown that for every algorithm for vertex-coloring graphs, there exists a logn-colorable graph for which the algorithm uses at least 2n= logn colors, and that this also holds for randomized algorithms, to within a constant factor, against an oblivious adversary.
Edge-Coloring and f-Coloring for Various Classes of Graphs
Efficient sequential and parallel algorithms which find ordinary edge-colorings and f- colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graph of fixed arboricity etc are given.
Algorithmic bounds on the chromatic number of a graph
  • P. Borowiecki
  • Mathematics
    2008 1st International Conference on Information Technology
  • 2008
The chromatic number of a graph is the smallest number of colors required to color its vertices such that no two adjacent vertices share a color. In the general case a problem of determining the
On Coloring Unit Disk Graphs
It is shown that the coloring problem for UD graphs remains NP-complete for any fixed number of colors k≥ 3, and a new 3-approximation algorithm for the problem is presented which is based on network flow and matching techniques.
Graph coloring in a class of parallel local algorithms
A way of improving the performance of a distributed algorithm is rendering a coloring strategy into an algorithm known as efficient in the nondistributed case. In this paper it is shown that certain
Total Colorings Of Degenerate Graphs
It is proved that an s-degenerate graph G has a total coloring with Δ+1 colors if the maximum degree Δ of G is sufficiently large, say Δ≥4s+3.
Ordering heuristics for parallel graph coloring
It is proved that JP-LLF and JP-SLL --- JP using the LLF and SLL heuristics, respectively --- execute with the same asymptotic work as JP-R and only logarithmically more span while producing higher-quality colorings thanJP-R in practice.
Separability and Vertex Ordering of Graphs
Many graph optimization problems, such as finding an optimal coloring, or a largest clique, can be solved by a divide-and-conquer approach. One such well-known technique is decomposition by clique


Two linear-time algorithms for five-coloring a planar graph
This paper uses graph contraction arguments instead of bicolor interchange and improves both the sequential processing and batch processing methods to obtain five-coloring algorithms that operate in O(n) time.
Bounded color functions on graphs
It is shown that every graph possesses a Grundy function bounded at each vertex by the maximum edge-connectivity of the subgraphs containing that vertex.
The Complexity of Near-Optimal Graph Coloring
It is proved that even coming close to khgr;(G) with a fast algorithm is hard, and it is shown that if for some constant r < 2 and constant d there exists a polynomial-time algorithm A which guarantees A(G).
k-Components, Clusters and Slicings in Graphs
Utilizing the edge-connectivity of graphs, certain maximally connected subgraphs of a graph termed k-components and clusters are characterized and their interrelations are investigated. The
An inequality for the chromatic number of a graph
New methods to color the vertices of a graph
An exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs and the new heuristic methods, the classical methods, and the exact method are compared.
An application of graph coloring to printed circuit testing
Under certain assumptions on the possible types of short circuits, the structure of line-of-sight graphs is analyzed and it is shown that a well-known and efficient algorithm can be used to color them with a small number of colors.
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Colouring random graphs
  • C. McDiarmid
  • Mathematics, Computer Science
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1975
This work discusses some results concerned with the behaviour of colouring algorithms on large random graphs and investigates the role of noise in the choice of colours.