Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
type: Item
instance of: scholarly article
title: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
zbMATH Open document ID: 1247.05156
author: Patrizio Angelini
author: Giuseppe Di Battista
author: Fabrizio Frati
author: Maurizio Patrignani
author: Ignaz Rutter
published in: Journal of Discrete Algorithms
publication date: 2012-09-13T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6082051
zbMATH Keywords: simultaneous embedding with fixed edges
zbMATH Keywords: planarity
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: SPQR-tree
Wikidata QID: Q56689204
MaRDI profile type: Publication
full work available at URL: j.jda.2011.12.015
OpenAlex ID: W1985459410
cites work: Q5417619
cites work: On a Tree and a Path with No Geometric Simultaneous Embedding
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: On simultaneous planar graph embeddings
cites work: On-line maintenance of triconnected components with SPQR-trees
cites work: On-Line Planarity Testing
cites work: SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
cites work: Simultaneous Embedding of Planar Graphs with Few Bends
cites work: Simultaneous Geometric Graph Embeddings
cites work: An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
cites work: Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
cites work: Embedding Graphs Simultaneously with Fixed Edges
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Simultaneous Graph Embeddings with Fixed Edges
cites work: Two trees which are self-intersecting when drawn simultaneously
cites work: Q4472293
cites work: Testing Simultaneous Planarity When the Common Graph Is 2-Connected
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Intersection Graphs in Simultaneous Embedding with Fixed Edges
DOI: 10.1016/J.JDA.2011.12.015
description: scientific article; zbMATH DE number 6082051