advances on testing c-planarity of embedded flat clustered graphs

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

Markus Chimani (Osnabrück University)

Joint work withGuiseppe Di Battista (University Roma Tre)

Fabrizio Frati (University of Sydney)

Karsten Klein (Monash University)

2

markus . chimani @ uni - osnabrueck . de C-Planarity @ Flat Embedded Graph Drawing 2014

Clustered Planarity (C-Planarity)

30

74

1

8

52 6 9

C = (G,T)

3

0

7

4

1

8

5

2

6

9

3

0

7

4

1

8

5

2

6

9

Complexity of c-planarity testing

c-connected: O(|V|) [Dahlhaus 98]non c-connected: P? NP? open for ~20 years…

3


Complexity for special cases

Polynomial cases…• C-connected [Feng et al. 95], [Dahlhaus 98]

• Completely c-connected [Cornelsen, Wagner 06]

• Almost c-connected [Gutwenger et al. 02]

• Extrovert [Goodrich et al. 05]

• “Cycles of Clusters” [Cortese et al. 05]

• and many more…

Unfortunately, most cases are very restricted and/or unnatural…Complexity even unknown for natural, seemingly simple subcases…• What if G is already embedded?• What if the cluster hierarchie is flat, i.e, only one level of clusters?• What if both?

4


Now: Flat embedded clustered graphs• One level of clusters (= no nested clusters)• G is embedded.• Does there exist a drawing of the cluster regions such that the resulting

drawing is c-planar?

Known polynomial subcases:• Maximum face-size at most 5 or “single conflict” graph [Di Battista, Frati 09]• At most two components per cluster-induced graph [Jelinek et al. 09]• Clustered cycles:

3 clusters [Cortese et al. 05], 3 vertices/cluster [Jelinkova at al. 09]

Flat & Embedded

3

0

7

4

1

8

5

2

6

9

5


Saturators

(Well known) idea: Flat embedded clustered graphs1. Each node starts within its own cluster region.2. Merge cluster regions along edges within the same cluster.

Step 2 is rather trivial to do in polynomial time…

3

0

7

4

1

8

5

10

9

6

YObserveNo nodes of same cluster are adjacent after Step 2.

2

X

6


Saturators

(Well known) idea: Flat embedded clustered graphs1. Each node starts within its own cluster region.2. Merge cluster regions along edges within the same cluster.3. Merge cluster regions of same cluster by adding

connectivity-establishing edges (con-edges) Saturator

Step 2 is rather trivial to do in polynomial time……but how to choose the con-edges in Step 3?

7

1

8

56

Y2

X

7


Saturators




7

1

8

56

Y2

X

AimFor each cluster, pick aspanning tree from itscon-edges, s.t. the differentspanning trees do not cross.

8


Saturators




7

1

8

56

Y2

X

AimFor each cluster, pick aspanning tree from itscon-edges, s.t. the differentspanning trees do not cross.

9


Single-conflict graph

“Single conflict graph”If every con-edge is involved in at most one crossing, the problem is polynomial time solvable [Di Battista, Frati 09]

So, this is not the case here…

7

1

8

56

Y2

X

10


k

l

2 vertices per cluster on each face

Our restriction:At most two vertices per cluster on each face.(“Single-conflict” graphs are a subset of those graphs)

f

d

i

c

a e

b

j

g

h

k

11


k

l

Not c-planar…

Here: By simple deduction, this graph is not c-planar

f

d

i

c

a e

b

j

g

h

k

Our algorithmAutomatically find a chain of deduction arguments to answer the c-planarity question.

12


Algorithm – Overview

Sequence of 4 Tests (detect non-c-planarity) and8 Simplifications (shrink instance)

(1) if each remaining con-edge has at most one crossing thenreturn ALGORITHMFORSINGLECONFLICT [Di Battista, Frati 09]

(2) if Test1 = true then return “non-c-planar”(3) if Simpl1 applicable then perform Simpl1 & goto (1)(4) if Test2 = true then return “non-c-planar”(5) if Simpl2 applicable then perform Simpl2 & goto (1)(6) if Simpl3 applicable then perform Simpl3 & goto (1)(7–12) …(13) perform Simpl8 & goto (1) //always applicable of we got

that far

13


Algorithm – Details

bd

ca

Let A[] the multigraph of all con-edges for cluster .

The first couple of tests & simplifications are trivial, e.g.• Test. Disconnected A[] No spanning tree non-c-planar

• Simplification. Bridge in A[] Merge vertices

cf

d

ba e

g

cdf

ba e

g

14



The next ones aren’t too hard either, e.g.• Test. Cyclic crossing sequence of odd length.

r

R

o

g

O

G

15


The final ones are harder and more cumbersome – but interesting, e.g.• Simplifications 6–8. “-donut”

Simplification 6: If isomorphicconflicting structures at two spokes

remove one of the spokes and pick the crossing edges


“spokes”

16


Algorithm

Wrapping upEventually (after several applications of the various simplifications),all -donuts vanish.Þ No con-edges with multiple crossings anymoreÞ Single-conflict graph solvable in polynomial time.

Since each test and simplification requires only polynomial time:

Theorem. The above algorithm decides c-planarity for flat embedded clustered graphs with at most two vertices per cluster on each facecorrectly in polynomial time.

Thank you

17


The road ahead…

What’s the problem with more vertices of the same cluster on a common face?

18


The road ahead…


19


The road ahead…


20


The road ahead…


21


The road ahead…


Anyhow… is it possible to always deal with richer faces efficiently?

Thank you

advances on testing c-planarity of embedded flat clustered graphs

Documents

merge cluster regions

cluster hierarchie

flat embeddedgraph drawing

flat embedded3074185269nr

clusterinduced graph

testing cplanarity

planarity testing c

edges saturator step