Mon premier blog

Fundamentals of domination in graphs by Peter Slater, Stephen Hedetniemi, Teresa W. Haynes

Fundamentals of domination in graphs Peter Slater, Stephen Hedetniemi, Teresa W. Haynes ebook
ISBN: 0824700333, 9780824700331
Page: 455
Publisher: CRC Press
Format: djvu

Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). (2004; Alber, Fellows For instance, for an n-vertex graph its optimization version is known to be polynomial-time approximable only up . Data Reduction for Domination in Graphs. An excellent treatment of the fundamentals of domination is given in the book by. Fundamentals of Domination in Graphs (Pure and Applied Mathematics) By Teresa W. Fundamentals of Domination in Graphs by Teresa W. Domination of graphs can be found in [1, 2, 4, 10, 11, 14, 16, 17, 19]. Haynes, Stephen Hedetniemi and Peter Slater English | ISBN: 0824700333 | edition 1998 | DJVU | 464 pages | 7,2 mb Fundamentals of Domin. The study of domination is one of the fastest growing areas within graph theory. A dominating set S of a graph G with the smallest cardinality ..