Drawing Bipartite Graphs in Two Layers with Specified Crossings

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00108276" target="_blank" >RIV/00216224:14330/19:00108276 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-030-11509-8_9" target="_blank" >http://dx.doi.org/10.1007/978-3-030-11509-8_9</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-11509-8_9" target="_blank" >10.1007/978-3-030-11509-8_9</a>

Result language

angličtina

Original language name

Drawing Bipartite Graphs in Two Layers with Specified Crossings

Original language description

We give a polynomial-time algorithm to decide whether a bipartite graph admits a two-layer drawing in the plane such that a specified subset of pairs of edges cross. This is a generalization of the problem of recognizing permutation graphs, and we generalize the characterization of permutation graphs.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA17-00837S" target="_blank" >GA17-00837S: Structural properties, parameterized tractability and hardness in combinatorial problems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

5th International Conference of Algorithms and Discrete Applied Mathematics (CALDAM 2019)

ISBN

9783030115081

ISSN

0302-9743

e-ISSN

—

Number of pages

12

Pages from-to

97-108

Publisher name

Springer

Place of publication

New York City

Event location

New York City

Event date

Jan 1, 2019

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

000611814000009