On the planar split thickness of graphs

David Eppstein, Philipp Kindermann, Stephen Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen Wismath

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest k such that the graph is k-splittable into a planar graph. A k-split operation substitutes a vertex v by at most k new vertices such that each neighbor of v is connected to at least one of the new vertices. We first examine the planar split thickness of complete and complete bipartite graphs. We then prove that it is NP-hard to recognize graphs that are 2-splittable into a planar graph, and show that one can approximate the planar split thickness of a graph within a constant factor. If the treewidth is bounded, then we can even verify k-splittablity in linear time, for a constant k.

Original languageEnglish (US)
Title of host publicationLATIN 2016
Subtitle of host publicationTheoretical Informatics - 12th Latin American Symposium, Proceedings
EditorsGonzalo Navarro, Evangelos Kranakis, Edgar Chávez
PublisherSpringer-Verlag
Pages403-415
Number of pages13
ISBN (Print)9783662495285
DOIs
StatePublished - Jan 1 2016
Event12th Latin American Symposium on Theoretical Informatics, LATIN 2016 - Ensenada, Mexico
Duration: Apr 11 2016Apr 15 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9644
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th Latin American Symposium on Theoretical Informatics, LATIN 2016
CountryMexico
CityEnsenada
Period4/11/164/15/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the planar split thickness of graphs'. Together they form a unique fingerprint.

Cite this