Graph-Theoretic Concepts in Computer Science 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings

This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held  in Cottbus, Germany, in June 2018.The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wi...

Full description

Saved in:
Bibliographic Details
Main Authors International Workshop on Graph-Theoretic Concepts in Computer Science, Brandstädt, Andreas, Köhler, Ekkehard, Meer, Klaus
Format eBook Book Conference Proceeding
LanguageEnglish
Published Cham Springer Nature 2018
Springer
Springer International Publishing AG
Springer International Publishing
Edition1
SeriesLecture Notes in Computer Science
Subjects
Algorithm Analysis and Problem Complexity
Arithmetic and Logic Structures
Computer Graphics
Computer Science
Computer science-Mathematics-Congresses
Data processing Computer science
Data Structures
Discrete Mathematics in Computer Science
Graph theory-Data processing-Congresses
Online AccessGet full text

Cover

Abstract This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held  in Cottbus, Germany, in June 2018.The 30 full papers presented in this volume were carefully reviewed and selected from 66 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.
AbstractList This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held  in Cottbus, Germany, in June 2018.The 30 full papers presented in this volume were carefully reviewed and selected from 66 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.
Author Köhler, Ekkehard
International Workshop on Graph-Theoretic Concepts in Computer Science
Meer, Klaus
Brandstädt, Andreas
Author_xml – sequence: 1
  fullname: International Workshop on Graph-Theoretic Concepts in Computer Science
– sequence: 2
  fullname: Brandstädt, Andreas
– sequence: 3
  fullname: Köhler, Ekkehard
– sequence: 4
  fullname: Meer, Klaus
BackLink https://cir.nii.ac.jp/crid/1130282270739794304$$DView record in CiNii
BookMark eNpdkE9P3DAQxQ1dELuwH6C3FUJCleoy9vhPfIQV0Eor9VDUq2UnXjYlxCHOtl-_zqaXcrFHb35vxn4LMmtjGwj5yOALA9A3RhcUKSBQAC4VlUdkmTXMykGQx2TOFGMUUZgP73ozMs81p0YLPCELDqwwElGJU7JgIPMCrow-I8uUfo0WKIxGmJPPj73rdvRpF2IfhrpcrWNbhm5Iq7rN9Wu3H0K_-lHWIcsX5GTrmhSW_-5z8vPh_mn9lW6-P35b326o45znRzjv1dZ7WaqAXvKq8AKdlFpDIUGDN0ZLF4A5zUqslNeiMlWBFQtmK7YK8Zx8mga79BL-pF1shmR_N8HH-JLsfx_P7M3Epq6v2-fQ24liYMdYR9qizbw9GOzouJ4cXR_f9iEN9jC4DO3Qu8be361VjtIIlsmriWzr2pb1eDKWewXnGjQabQSCyNjlhJUuuSZj9jW28XlMNlkpmFQc8C8vRoJS
ContentType eBook
Book
Conference Proceeding
Copyright Springer Nature Switzerland AG 2018
Copyright_xml – notice: Springer Nature Switzerland AG 2018
DBID I4C
RYH
DEWEY 004
DOI 10.1007/978-3-030-00256-5
DatabaseName Casalini Torrossa eBooks Institutional Catalogue
CiNii Complete
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Mathematics
DocumentTitleAlternate Graph-theoretic concepts in computer science
Advanced research in computing and software science
EISBN 9783030002565
303000256X
EISSN 1611-3349
Edition 1
1st Edition 2018
Editor Meer, Klaus
Brandst'dt, Andreas
K'hler, Ekkehard
Editor_xml – sequence: 1
  fullname: Brandst'dt, Andreas
– sequence: 2
  fullname: K'hler, Ekkehard
– sequence: 3
  fullname: Meer, Klaus
ExternalDocumentID 9783030002565
471390
EBC6302941
BB26994238
5415620
GroupedDBID 0D6
0DA
38.
AABBV
ACOUV
AEDXK
AEKFX
AEZAY
ALMA_UNASSIGNED_HOLDINGS
ANXHU
BBABE
BICGV
BJAWL
BUBNW
CVGDX
CZZ
EDOXC
FOYMO
I4C
IEZ
LDH
NQNQZ
OEBZI
SBO
TPJZQ
TSXQS
Z7X
Z83
Z88
AEJLV
RYH
-DT
-~X
29L
2HA
2HV
ACGFS
ADCXD
EJD
F5P
LAS
P2P
RSU
~02
ID FETCH-LOGICAL-a22202-abb6fbb5c6e3b52d8b43a5577085070b9975ae01a71c3d6b74d9d83d1e9f4f633
ISBN 9783030002565
303000256X
3030002551
9783030002558
ISSN 0302-9743
IngestDate Fri Nov 08 03:57:13 EST 2024
Tue Oct 01 19:22:19 EDT 2024
Fri May 30 22:02:43 EDT 2025
Thu Jun 26 21:56:02 EDT 2025
Tue Nov 14 22:50:29 EST 2023
IsPeerReviewed true
IsScholarly true
LCCN 2018953364
LCCallNum_Ident Q
Language English
LinkModel OpenURL
MeetingName International Workshop on Graph-Theoretic Concepts in Computer Science
MergedId FETCHMERGED-LOGICAL-a22202-abb6fbb5c6e3b52d8b43a5577085070b9975ae01a71c3d6b74d9d83d1e9f4f633
Notes Includes bibliographical references and index
"LNCS sublibrary: SL1 - Theoretical computer science and general issues"--T.p. verso
OCLC 1051002697
PQID EBC6302941
PageCount 396
ParticipantIDs askewsholts_vlebooks_9783030002565
springer_books_10_1007_978_3_030_00256_5
proquest_ebookcentral_EBC6302941
nii_cinii_1130282270739794304
casalini_monographs_5415620
PublicationCentury 2000
PublicationDate 2018
c2018
20180902
2018-09-01
PublicationDateYYYYMMDD 2018-01-01
2018-09-02
2018-09-01
PublicationDate_xml – year: 2018
  text: 2018
PublicationDecade 2010
PublicationPlace Cham
PublicationPlace_xml – name: Netherlands
– name: Cham
PublicationSeriesSubtitle Theoretical Computer Science and General Issues
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationYear 2018
Publisher Springer Nature
Springer
Springer International Publishing AG
Springer International Publishing
Publisher_xml – name: Springer Nature
– name: Springer
– name: Springer International Publishing AG
– name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Steffen, Bernhard
Pandu Rangan, C.
Kanade, Takeo
Kittler, Josef
Weikum, Gerhard
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
– sequence: 8
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
– sequence: 9
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
– sequence: 10
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
– sequence: 11
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
– sequence: 12
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
SSID ssj0002089730
ssj0002792
Score 2.427579
Snippet This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held  in...
SourceID askewsholts
springer
proquest
nii
casalini
SourceType Aggregation Database
Publisher
SubjectTerms Algorithm Analysis and Problem Complexity
Arithmetic and Logic Structures
Computer Graphics
Computer Science
Computer science-Mathematics-Congresses
Data processing Computer science
Data Structures
Discrete Mathematics in Computer Science
Graph theory-Data processing-Congresses
Subtitle 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings
TableOfContents 2 Angle-Monotone Graphs of Width 90 -- 3 Angle-Monotone Graphs of Width (90+) -- 3.1 3-Sweep Graphs -- 3.2 Layered 3-Sweep Graphs -- 4 Local Routing in Layered 3-Sweep Graphs -- 5 Open Questions -- References -- Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three -- 1 Introduction -- 2 Preliminaries -- 3 Characterization -- 3.1 BS1' Contains Exactly Two Maximal Separated Subgraphs -- 3.2 BS1' Contains Exactly One Maximal Separated Subgraph -- 3.3 Characterization Theorem -- 4 Recognition -- 5 Conclusion -- References -- Author Index
2 Problem Definition and Statement of the Main Result -- 3 FPT-Algorithm for Weak Isomorphism -- 4 Bounded Color Class Hypergraph Isomorphism -- References -- Connected Vertex Cover for (sP1+P5)-Free Graphs -- 1 Introduction -- 2 Preliminaries -- 3 An Auxiliary Problem -- 4 Our Main Result -- 5 Future Work -- References -- Structurally Parameterized d-Scattered Set -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 Treewidth: SETH Lower Bound -- 4 Treewidth: Dynamic Programming Algorithm -- 5 Vertex Cover, Feedback Vertex Set: W[1]-Hardness -- 6 Vertex Cover: FPT Algorithm -- 7 Tree-Depth: Tight ETH Lower Bound -- 8 Treewidth Revisited: FPT-AS -- References -- Popular Matchings of Desired Size -- 1 Introduction -- 2 Preliminaries -- 3 The NP-Hardness proof -- 4 A Near-Popular Matching of Size k -- References -- Convexity-Increasing Morphs of Planar Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Computing Convexity-Increasing Morphs -- 4 Using Tutte's Algorithm to Find Convex Drawings Preserving y-Coordinates -- 5 Conclusions -- References -- Treedepth Bounds in Linear Colorings -- 1 Introduction -- 2 Definitions and Background -- 2.1 Graph Terminology -- 2.2 p-Centered Colorings and Bounded Expansion -- 2.3 Centered Colorings and Treedepth -- 3 p-Linear and Linear Colorings -- 4 Treedepth Lower Bounds -- 5 Treedepth Upper Bounds on Trees -- 6 Treedepth Upper Bounds on Interval Graphs -- 7 Hardness of Recognizing Linear Colorings -- 8 Conclusion -- References -- An Improved FPT Algorithm for Independent Feedback Vertex Set -- 1 Introduction -- 2 Preliminaries -- 3 An Algorithm for Independent Feedback Vertex Set -- 3.1 Disjoint Independent Feedback Vertex Set -- 3.2 Reduction Rules for DIS-IFVS -- 3.3 Branching for DIS-IFVS -- 4 Conclusion -- References -- Construction and Local Routing for Angle-Monotone Graphs -- 1 Introduction
2 Number of st-Cuts in a Biconnected Graph -- 2.1 Backbone of the Graph -- 2.2 Case Analysis on the st-Cut Types -- 2.3 Graphs that Allow for an st-Numbering -- 3 Conclusions and Further Work -- References -- Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 A Subexponential-Time Algorithm for C-Planarity -- 4 An MSO2 Formulation for C-Planarity -- 5 Conclusions and Open Problems -- References -- Computing Small Pivot-Minors -- 1 Introduction -- 2 When H Is Part of the Input -- 3 When H Is Fixed -- 3.1 When H Is 3P1-Free -- 3.2 When H Is Not 3P1-Free -- 4 Future Work -- References -- Saving Probe Bits by Cube Domination -- 1 Introduction -- 1.1 The Setting -- 1.2 Contributions -- 1.3 Background -- 2 Preliminaries -- 3 Cube Domination in Hypercubes -- 4 Ignoring One Bit -- 5 Ignoring Two Bits -- 5.1 Approach -- 5.2 Results -- 5.3 Ignoring Even More Bits -- 6 Conclusions -- References -- Graph Amalgamation Under Logical Constraints -- 1 Introduction -- 2 Preliminaries -- 2.1 Concrete Tree Decompositions -- 3 An Algorithm for Amalgamation Recognition -- 4 Amalgamating Graphs Under CMSO Constraints -- 4.1 Amalgamation Recognition -- 4.2 Amalgamability -- 4.3 (1,2)-Factors -- 5 Conclusion -- References -- R-Completeness and Area-Universality -- 1 Introduction -- 2 Toolbox: Hard Variants of ETR and UETR -- 3 Hardness of Area Universality for Triples PA -- 4 Hardness of Prescribed Area PE -- 5 Volume-Universality -- 6 Potential Complete Problems -- References -- Optimal General Matchings -- 1 Introduction -- 2 Uniform B-matching -- 3 Structure of General B-matchings -- 4 Algorithm for Computing a Maximum Cardinality B-matching -- References -- Quasimonotone Graphs -- 1 Introduction -- 1.1 Definitions and Notation -- 1.2 Structure of the Paper
2 Quasi-classes and Pre-graphs -- 2.1 Examples -- 3 The Structure of Quasimonotone Graphs -- 3.1 Flaws and Preholes -- 3.2 Properties of Flawless Graphs -- 3.3 Determining a Short Odd Hole -- 4 Flawless Graphs Containing a Long Hole -- 4.1 Triangles -- 4.2 Long Odd Holes -- 5 Preholes in Flawless Graphs -- 5.1 Splitting -- 5.2 Recognising Preholes -- 6 Flawless Graphs Without Long Holes -- 6.1 Minimal Preholes in Hole-Free Graphs -- 6.2 Preholes Containing 5-Holes and Triangles -- 7 Conclusion and Discussion -- References -- Equiangular Polygon Contact Representations -- 1 Introduction -- 2 The Existence of Equiangular K-gon Contact Representations -- 3 The Combinatorial Structure of Equiangular Polygon Contact Representations -- 4 Coloring K-contact-structures -- 5 The Distributive Lattice of K-contact-structures -- 6 System of Linear Equations -- 7 A Heuristic -- References -- Temporal Graph Classes: A View Through Temporal Separators -- 1 Introduction -- 2 Preliminaries -- 3 Structural Restrictions -- 3.1 Layer-Wise Restrictions -- 3.2 Underlying-Wise Restrictions -- 4 Temporal Restrictions -- 5 Conclusion -- References -- Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization -- 1 Introduction -- 2 Forbidding Trivial Paths -- 3 Concluding Remarks -- References -- On the Relation of Strong Triadic Closure and Cluster Deletion -- 1 Introduction -- 2 On Problem Kernelizations -- 3 Fixed-Parameter Algorithms for the Parameterization by the Number of Strong or Cluster Edges -- 4 STC and Cluster Deletion on H-free Graphs -- References -- On Perfect Linegraph Squares -- 1 Introduction -- 2 Preliminaries -- 3 Induced Graphs in L( G )L( G )L( G )L( G )2 -- 3.1 Induced Paths in G2 -- 3.2 Linegraphs -- 4 Conclusion (-Boundedness) -- References -- On Weak Isomorphism of Rooted Vertex-Colored Graphs -- 1 Introduction
Intro -- Preface -- Acknowledgments -- Organization -- Contents -- On Dispersable Book Embeddings -- 1 Introduction -- 2 The Dispersable Book Thickness of the Folkman Graph -- 3 The Dispersable Book Thickness of the Gray Graph -- 4 3-Connected 3-Regular Bipartite Planar Graphs -- 5 Conclusions -- References -- Characterising AT-free Graphs with BFS -- 1 Introduction -- 2 Preliminaries -- 3 Convex Geometries and AT-free Graphs -- 4 AT-free BFS-Orders -- 5 AT-free Orders in Claw-free AT-free Graphs -- 6 Conclusion -- References -- Edge Partitions of Optimal 2-plane and 3-plane Graphs -- 1 Introduction -- 2 Preliminaries and Notation -- 3 Edge Partitions of Optimal 2-plane Graphs -- 3.1 Edge Partitions with Acyclic Subgraphs -- 3.2 Edge Partitions with Bounded Vertex Degree Subgraphs -- 4 Edge Partitions of Optimal 3-plane Graphs -- 5 Open Problems -- References -- On Minimum Connecting Transition Sets in Graphs -- 1 Introduction -- 2 Polynomial Algorithms and Structural Results -- 3 NP-hardness -- 4 Conclusion -- References -- Recognizing Hyperelliptic Graphs in Polynomial Time -- 1 Introduction -- 2 Preliminaries -- 2.1 Definitions -- 2.2 Constraints -- 2.3 Reduction Rules, Safeness and Completeness -- 3 Reduction Rules for Divisorial Gonality -- 4 Main Algorithm -- 5 Conclusion -- References -- On Directed Feedback Vertex Set Parameterized by Treewidth -- 1 Introduction -- 2 Preliminaries -- 3 Connectivity Patterns -- 4 Lower Bound -- 5 Concluding Remarks -- References -- Optimality Program in Segment and String Graphs -- 1 Introduction -- 2 Upper Bounds -- 3 Lower Bounds -- 4 Perspectives -- References -- Anagram-Free Chromatic Number Is Not Pathwidth-Bounded -- 1 Introduction -- 2 Proof of Theorem1 -- 3 Proof of Theorem2 -- 4 Remarks -- References -- Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts -- 1 Introduction
Title Graph-Theoretic Concepts in Computer Science
URI http://digital.casalini.it/9783030002565
https://cir.nii.ac.jp/crid/1130282270739794304
https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6302941
http://link.springer.com/10.1007/978-3-030-00256-5
https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783030002565
Volume 11159
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR3LbtQw0KLlQi_lUURoiyLEgQNGTmzH8aEHqLZUVak4LFVvVpw40qoolUjoga9nJo6T3WiRoJdoZVne8Yw97xkT8g4LrB3YsrQCMKlIS061zDOaom7Nde6Ew-Lkr1fZ-XdxcSNvphdP--qSzn4sf2-tK3kIVWEM6IpVsv9B2XFRGIDfQF_4AoXhO1N-t8qZL9hsmi5DKSJW72GSSusr-fxrDeHyeu6BXY3bk8shbnB117m_Tx5cAUmft8AmwzG4AmfOxMmftWE7guxivUWxxv5gKKVgYXiW4zxLzLDRIfeNRUeeCYqk3sqB15MuYDnaK1VUTuJmTAIEscg12yE7KgeO-vjT4uLyenSPpSzXCi2bQahin0MfEPIAYplO2EDiGylNGwrR66GB8AYge2SvaG9BgIBw6VrURoq2wCJUUC6a1WrD0JjFxnuVY_mUHEzFmPG3kfzPyCPXPCf7gWTxQLIX5MPsOMThOMSrJp5PPyDXZ4vl6Tkd3sKgBWhwsOnC2qy2VpaZ41amVW4FL6RUCnsOKma1VrJwLClUUvIqs0pUusp5lThdizrj_CXZbe4a94rEEgWc45rnlmGWr7bKCVVqVjlX1LyOyNs1FJn7H33cvjVrOM5kRA4D5gxcK99fvTUSHQIpi8gxINOUK_wmGBwHRVRhVBgbEjIRkTig2fSrD6nIZvH5NIPZWiQReR_Qb_z_hw7bAIfhBiAxPShGvv73qYfkyXRzjshu9_OXOwa1srNvhiP4B6C1Z1I
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Graph-Theoretic+Concepts+in+Computer+Science&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2018-09-02&rft.pub=Springer+International+Publishing&rft.isbn=9783030002558&rft.issn=0302-9743&rft.eissn=1611-3349&rft.volume=11159&rft_id=info:doi/10.1007%2F978-3-030-00256-5&rft.externalDocID=471390
thumbnail_m http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97830300%2F9783030002565.jpg
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-030-00256-5