Sinossi
The domination problem in graph theory is to find a minimum sized vertex subset in a graph such that every vertex not in this set is adjacent to at least one vertex in this set. The domination problem and its variations serve as good models for many real problems including location problems in operations research. This comprehensive volume introduces domination and its variations in graphs from an algorithmic point of view. It examines the structures of various graph classes, including trees, chordal graphs, strongly chordal graphs, interval graphs, comparability graphs, permutation graphs, distance-hereditary graphs and generalizations of these graphs. These structure properties provide concepts for designing the algorithms. This useful reference text benefits researchers, academics, and graduate students in theoretical computer science, combinatorics, and operations research.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Algorithmic Aspects Of Domination In Graphs: 17
Foto dell'editore
Algorithmic Aspects Of Domination In Graphs (Lecture Notes Series on Computing)
Da: suffolkbooks, Center moriches, NY, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Very Good. Fast Shipping - Safe and Secure 7 days a week! Codice articolo mon0000006866
Compra usato
EUR 51,41
Spedizione EUR 3,49
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Algorithmic Aspects of Domination in Graphs
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 52180172-n
Compra nuovo
EUR 113,57
Spedizione EUR 2,31
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Aspects Of Domination In Graphs (Hardcover)
Editore:
World Scientific Publishing Co Pte Ltd, Singapore, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
Nuovo
Rilegato
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. The domination problem in graph theory is to find a minimum sized vertex subset in a graph such that every vertex not in this set is adjacent to at least one vertex in this set. The domination problem and its variations serve as good models for many real problems including location problems in operations research. This comprehensive volume introduces domination and its variations in graphs from an algorithmic point of view. It examines the structures of various graph classes, including trees, chordal graphs, strongly chordal graphs, interval graphs, comparability graphs, permutation graphs, distance-hereditary graphs and generalizations of these graphs. These structure properties provide concepts for designing the algorithms. This useful reference text benefits researchers, academics, and graduate students in theoretical computer science, combinatorics, and operations research. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9789819817283
Compra nuovo
EUR 115,96
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Algorithmic Aspects Of Domination In Graphs (Lecture Notes Series on Computing)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo I-9789819817283
Compra nuovo
EUR 116,33
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Aspects of Domination in Graphs
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 52180172
Compra usato
EUR 123,80
Spedizione EUR 2,31
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Aspects of Domination in Graphs
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 52180172
Compra usato
EUR 131,33
Spedizione EUR 17,59
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Aspects of Domination in Graphs
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 52180172-n
Compra nuovo
EUR 135,55
Spedizione EUR 17,59
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Algorithmic Aspects Of Domination In Graphs
Editore:
World Scientific Publishing Co Pte Ltd, SG, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
Nuovo
Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. The domination problem in graph theory is to find a minimum sized vertex subset in a graph such that every vertex not in this set is adjacent to at least one vertex in this set. The domination problem and its variations serve as good models for many real problems including location problems in operations research. This comprehensive volume introduces domination and its variations in graphs from an algorithmic point of view. It examines the structures of various graph classes, including trees, chordal graphs, strongly chordal graphs, interval graphs, comparability graphs, permutation graphs, distance-hereditary graphs and generalizations of these graphs. These structure properties provide concepts for designing the algorithms. This useful reference text benefits researchers, academics, and graduate students in theoretical computer science, combinatorics, and operations research. Codice articolo LU-9789819817283
Compra nuovo
EUR 161,13
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Algorithmic Aspects Of Domination In Graphs: 17 (Lecture Notes Series on Computing)
Editore:
World Scientific Publishing Co Pte Ltd, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
Nuovo
Rilegato
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 360 pages. 3.94x3.94x2.36 inches. In Stock. Codice articolo x-9819817285
Compra nuovo
EUR 155,14
Spedizione EUR 14,66
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
ALGORITHMIC ASPECTS OF DOMINATION IN GRAPHS
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. ALGORITHMIC ASPECTS OF DOMINATION IN GRAPHS | Chang Gerard Jennhwa | Buch | Englisch | 2026 | World Scientific | EAN 9789819817283 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Codice articolo 134464605
Compra nuovo
EUR 112,25
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili