Filters
Irreducibility of the Tutte polynomial of an embedded graph
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded g...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2022 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
Testing Planarity of Partially Embedded Graphs
We present a linear time algorithm for deciding if a planar embedding of a part of graph can be extended to a noncrossing embedding of the entire graph. We further who that several optimization extensions of this p...
BD - Teorie informace
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Drawing Simultaneously Embedded Graphs with Few Bends
We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this ...
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Drawing Simultaneously Embedded Graphs with Few Bends
We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
A Kuratowski-type theorem for planarity of partially embedded graphs
A partially embedded graph (or PEG) is a triple (G, H, H), where G is a graph, H is a subgraph of G, and H is a planar embedding of H. We say that a PEG (G, H, H) is planar if the graph G has a planar ...
BA - Obecná matematika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A lower bound for dilation of an embedding
Graph embedding problems have gained importance in the field of interconnection to obtain a lower bound for dilation of an embedding. Moreover, we give algorithms to compute exact dilation of embedding circulant ne...
BA - Obecná matematika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Logspace reduction of directed reachability for bounded genus graphs to the planar case
We show that reachability in directed graphs embedded on a fixed surface of arbitrary genus is logspace-reducible to reachability in directed graphs embedded in the plane....
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Toroidal grid minors and stretch in embedded graphs
We investigate the toroidal expanse of an embedded graph G, that is, the size of the largest toroidal grid contained in G as a minor. In the course of this work we introduce a new embedding density parameter, the stretch of...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Extended Abstract)
We show a polynomial time algorithm for deciding if there is a cluster embedding for graphs with two components where all clusters have at most two components....
BA - Obecná matematika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
A Kuratowski-type theorem for planarity of partially embedded graphs
A partially embedded graph (or PEG) is a triple (G,H,EH), where G is a graph, H is a subgraph of G, and EH is a planar embedding of H. We say that a PEG (G,H,EH) is planar if the graph G has a planar e...
IN - Informatika
- 2011 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 13 348