01102nam0 22002771i 450 UON0019261220231205103221.34620030730d1955 |0itac50 baengGB|||| 1||||Jonathan SwiftJohn Middleton MurryLondonLongmans195544 p.22 cm.001UON003436072001 Writers and Their Work210 LondonLongmans Green & CO.61SWIFT JONATHANUONC039713FIGBLondonUONL003044820.09Letteratura inglese e in antico inglese. Storia, descrizione, studi critici21MURRYJohn MiddletonUONV121947385498Longmans, Green & Co.UONV273257650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00192612SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI Angl IV B SWI MUR SI MR 62352 5 BuonoJonathan Swift1291942UNIOR05117nam 22007095 450 991034928180332120251230065512.03-030-30786-710.1007/978-3-030-30786-8(CKB)4100000009273621(DE-He213)978-3-030-30786-8(MiAaPQ)EBC5926442(PPN)255585039(EXLCZ)99410000000927362120190911d2019 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierGraph-Theoretic Concepts in Computer Science 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers /edited by Ignasi Sau, Dimitrios M. Thilikos1st ed. 2019.Cham :Springer International Publishing :Imprint: Springer,2019.1 online resource (XXI, 394 p. 304 illus., 41 illus. in color.)Theoretical Computer Science and General Issues,2512-2029 ;117893-030-30785-9 Logic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac’s condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs.This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.Theoretical Computer Science and General Issues,2512-2029 ;11789MathematicsData processingComputer scienceMathematicsDiscrete mathematicsArtificial intelligenceData processingAlgorithmsComputer arithmetic and logic unitsComputational Mathematics and Numerical AnalysisDiscrete Mathematics in Computer ScienceData ScienceAlgorithmsArithmetic and Logic StructuresMathematicsData processing.Computer scienceMathematics.Discrete mathematics.Artificial intelligenceData processing.Algorithms.Computer arithmetic and logic units.Computational Mathematics and Numerical Analysis.Discrete Mathematics in Computer Science.Data Science.Algorithms.Arithmetic and Logic Structures.511.5004.0151Sau Ignasiedthttp://id.loc.gov/vocabulary/relators/edtThilikos Dimitrios Medthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910349281803321Graph-Theoretic Concepts in Computer Science2569248UNINA