Graph-Theoretic Concepts in Computer Science
Editat de Rolf H. Möhringen Limba Engleză Paperback – 24 apr 1991
Preț: 326.05 lei
Preț vechi: 407.56 lei
-20%
Puncte Express: 489
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540538325
ISBN-10: 3540538321
Pagini: 376
Ilustrații: XIII, 367 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540538321
Pagini: 376
Ilustrații: XIII, 367 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Optimal parallel algorithms for sparse graphs.- Finding minimally weighted subgraphs.- On the complexity of some coloring games.- A generalized best-first search method in graphs.- Avoiding matrix multiplication.- Induced subraph isomorphism for cographs is NP-complete.- On feedback problems in planar digraphs.- Recognizing binary hamming graphs in O(n 2 log n) time.- Vertex-disjoint trees and boundary single-layer routing.- Bounds on the quality of approximate solutions to the group Steiner problem.- Two polynomial problems in PLA folding.- The VLSI layout problem in various embedding models.- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems.- Deterministic message routing in faulty hypercubes.- On complexity of a message-routing strategy for multicomputer systems.- Embeddings of treelike graphs into 2-dimensional meshes.- Diagnosis of t/s-diagnosable systems.- Deciding 1-solvability of distributed task is NP-hard.- Remarks on some concurrency measures.- On the rectilinear art gallery problem algorithmic aspects.- Separation problems and circular arc systems.- Genus of orders and lattices.- Comparing the expressibility of two languages formed using NP-complete graph operators.- Decomposition of linear recursive logic programs.- On the transition graphs of automata and grammars.- Algebraic approach to graph transformation based on single pushout derivations.