Graph-Theoretic Concepts in Computer Science
Editat de Ernst W. Mayren Limba Engleză Paperback – 5 aug 2016
The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 325.44 lei 43-57 zile | |
| Springer – 26 feb 1993 | 325.44 lei 43-57 zile | |
| Springer – 5 aug 2016 | 333.82 lei 43-57 zile |
Preț: 333.82 lei
Preț vechi: 417.28 lei
-20%
Puncte Express: 501
Preț estimativ în valută:
59.03€ • 67.69$ • 51.02£
59.03€ • 67.69$ • 51.02£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783662531730
ISBN-10: 3662531739
Pagini: 528
Ilustrații: XIV, 514 p. 106 illus.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.79 kg
Ediția:1st edition 2016
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662531739
Pagini: 528
Ilustrații: XIV, 514 p. 106 illus.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.79 kg
Ediția:1st edition 2016
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Computer Vision: Models, Learning, and InferenceSimon J. D. Prince-20%Preț: 528.19 lei660.24 lei -
Enterprise Content and Search Management for Building Digital PlatformsShailesh Kumar Shivakumar-20%Preț: 484.53 lei605.66 lei -
-20%Preț: 1126.02 lei1407.52 lei -
Spock – Up and RunningRob Fletcher-20%Preț: 333.29 lei416.62 lei -
Tragic DesignJonathan Shariat-20%Preț: 178.59 lei223.23 lei -
Thoughtful Machine Learning with PythonMatthew Kirk-20%Preț: 238.67 lei298.35 lei -
This is Service Design DoingMarc Stickdorn-20%Preț: 245.88 lei307.35 lei -
High Performance SparkHolden Karau-20%Preț: 232.55 lei290.68 lei -
Practical TableauRyan Sleeper-20%Preț: 304.07 lei380.09 lei -
A Course in Mathematical CryptographyGilbert Baumslag-20%Preț: 319.06 lei398.82 lei -
Distributed AlgorithmsSam Toueg-20%Preț: 324.02 lei405.03 lei -
Constructivity in Computer ScienceJ. Paul Jr. Myers-20%Preț: 320.32 lei400.41 lei -
Hyperedge Replacement: Grammars and LanguagesAnnegret Habel-20%Preț: 318.69 lei398.37 lei -
Distributed AlgorithmsAdrian Segall-20%Preț: 327.07 lei408.84 lei -
Meta-Programming in LogicAlberto Pettorossi-20%Preț: 325.63 lei407.04 lei -
-20%Preț: 316.03 lei395.04 lei -
Foundations of Software Technology and Theoretical Computer ScienceRudrapatna Shyamasundar-20%Preț: 328.49 lei410.62 lei -
-20%Preț: 633.38 lei791.72 lei -
-20%Preț: 325.44 lei406.80 lei -
Computer Algebra in Scientific ComputingVladimir P. Gerdt-20%Preț: 327.69 lei409.62 lei -
-20%Preț: 326.55 lei408.19 lei -
Computer Algebra in Scientific ComputingViktor G. Ganzha-20%Preț: 327.27 lei409.09 lei -
Computer Algebra in Scientific Computing CASC 2001Viktor G. Ganzha-20%Preț: 333.16 lei416.44 lei
Cuprins
Invited Talks.- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.- Open Problems on Graph Coloring for Special Graph Classes.- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.- Computational Complexity.- The Stable Fixtures Problem with Payments.- Complexity of Secure Sets.- Efficient Domination for Some Subclasses of P6-free Graphs in Polynomial Time.- On the Tree Search Problem with Non-uniform Costs.- An O(n2) Time Algorithm for the Minimal Permutation Completion Problem.- On the Number of Minimal Separators in Graphs.- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks.- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.- Finding Paths in Grids with Forbidden Transitions.- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results.- Design and Analysis.- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes.- Approximating Source Location and Star Survivable Network Problems.- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.- Computational Geometry.- Weak Unit Disk and Interval Representation of Graphs.- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes.- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes.- Unsplittable Coverings in the Plane.- Structural Graph Theory.- Induced Minor Free Graphs: Isomorphism and Clique-width.- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.- Colouring and Covering Nowhere Dense Graphs.- Parity Linkage and the Erdös-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs.- Well-quasi-ordering Does Not Imply Bounded Clique-width.- A Slice Theoretic Approach for Embedding Problems on Digraphs.- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs.- Graph Drawing.- Saturated Simple and 2-simple Topological Graphs with Few Edges.- Testing Full Outer-2-planarity in Linear Time.- Fixed Parameter Tractability.- Triangulating Planar Graphs While Keeping the Pathwidth Small.- Polynomial Kernelization for Removing Induced Claws and Diamonds.- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.- Recognizing k-equistable Graphs in FPT Time.- Beyond Classes of Graphs with \Few" Minimal Separators: FPT.- Results Through Potential Maximal Cliques.
Caracteristici
Includes supplementary material: sn.pub/extras