✦ LIBER ✦

Efficient algorithms for acyclic colorings of graphs

✍ Scribed by Zhi-Zhong Chen

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 209 KB
Volume: 230
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00254-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge colorings of graphs

✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_

Acyclic colorings of planar graphs

✍ Wayne Goddard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Acyclic edge-colorings of sparse graphs

✍ Y. Caro; Y. Roditty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A k-forest is a forest in which the maximum degree is k. The k-arboricity denoted Ak(G) is the minimum number of k-forests whose union is the graph G. We show that if G is an m-degenerate graph of maximum degree A, then Ak(G) 5 [(A + (k -1) m -1)/k], k 2 2, and derive several consequences of this in

Algorithms for maximum k-colorings and k

Algorithms for maximum k-colorings and k-coverings of transitive graphs

✍ Fǎnicǎ Gavril 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

Consider a graph G and a positive integer k. The maximum k-coloring problem is to color a maximum number of vertices using k colors, such that no two adjacent vertices have the same color. The maximum k-covering problem is to find k disjoint cliques covering a maximum number of vertices. The present

Improved shortest path algorithms for ne

Improved shortest path algorithms for nearly acyclic graphs

✍ Shane Saunders; Tadao Takaoka 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Dijkstra's algorithm solves the single-source shortest path problem on any directed graph in O(m + n log n) time when a Fibonacci heap is used as the frontier set data structure. Here n is the number of vertices and m is the number of edges in the graph. If the graph is nearly acyclic, other algorit

Shortest path algorithms for nearly acyc

Shortest path algorithms for nearly acyclic directed graphs

✍ Tadao Takaoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m + n log t) computing time, where m and n are the numbers of edges and vertices of the given directed graph and t is the number of delete-min operations in the priority qu