• Nem Talált Eredményt

Precoloring extension

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Precoloring extension"

Copied!
34
0
0

Teljes szövegt

(1)

Precoloring extension on chordal graphs

D ´aniel Marx

Budapest University of Technology and Economics

dmarx@cs.bme.hu

Graph Theory 2004, July 5–9, Paris

(2)

Precoloring extension

Generalization of vertex coloring: given a partial coloring, extend it to the whole graph using

k

colors.

Example for

k = 3

: Example for

k = 2

:

Cannot be extended!

(3)

Precoloring extension (cont.)

Vertex coloring is a special case of precoloring extension (PREXT).

PREXT is polynomial time solvable for complements of bipartite graphs cographs

split graphs trees

partial

k

-trees

PREXT is NP-complete for bipartite graphs

line graphs of bipartite graphs line graphs of planar graphs interval graphs

(4)

The special case 1-P R E XT

1-PREXT: every color occurs at most once in the precoloring. In general, not easier than PREXT: the vertices precolored with the same color can be identified.

(5)

The special case 1-P R E XT

1-PREXT: every color occurs at most once in the precoloring. In general, not easier than PREXT: the vertices precolored with the same color can be identified.

(6)

The special case 1-P R E XT

1-PREXT: every color occurs at most once in the precoloring. In general, not easier than PREXT: the vertices precolored with the same color can be identified.

(7)

The special case 1-P R E XT

1-PREXT: every color occurs at most once in the precoloring. In general, not easier than PREXT: the vertices precolored with the same color can be identified.

(8)

The special case 1-P R E XT

1-PREXT: every color occurs at most once in the precoloring. In general, not easier than PREXT: the vertices precolored with the same color can be identified.

However, 1-PREXT can be easier for a restricted graph class: PREXT for interval graphs is NP-hard [Bir ´o, Hujter, Tuza, 1992], even if every interval has the same length [M. 2003].

1-PREXT is polynomial-time solvable for interval graphs [Bir ´o, Hujter, Tuza, 1992].

(9)

An application

Example: Assign aircrafts (colors) to the different flights (time intervals).

(10)

An application

Example: Assign aircrafts (colors) to the different flights (time intervals).

(11)

An application

Example: Assign aircrafts (colors) to the different flights (time intervals).

Interval coloring is linear time solvable

linear time algorithm for scheduling.

The problem is NP-hard if there are preassigned flights (PREXT).

If each aircraft has a preassigned maintenance interval, then the problem can be solved in polynomial time (1-PREXT).

(12)

Chordal graphs

Question: [Bir ´o, Hujter, Tuza] Is it possible to generalize the 1-PREXT algorithm for chordal graphs?

Our main result: 1-PREXT is polynomial-time solvable for chordal graphs.

A graph is chordal if it does not contain induced cycles longer than 3.

Interval graphs are chordal.

Intersection graphs of intervals on a line

interval graphs.

Intersection graphs of subtrees in a tree

chordal graphs.

Chordal graphs are perfect.

(13)

Tree decomposition

Every chordal graph can be built using the following operations. We consider chordal graphs with a distinguished clique.

Add: attach a new vertex to the clique. Forget: remove a vertex from the clique.

Join: identify the cliques of two chordal graphs.

(14)

Coloring chordal graphs

Tree decomposition gives a method of coloring chordal graphs. Main idea: before the join operation we can permute the colors such that the clique has the same coloring in both graphs.

This approach does not work if there are precolored vertices:

PSfrag replacements

precolored precolored

The two colorings cannot be joined!

(15)

Precoloring extension

Idea 1: For each subgraph appearing in the construction of the chordal graph, list all possible colorings that can appear on the distinguished clique in a precoloring extension.

The graphs can be joined if they have colorings that agree on the clique. The colors outside the clique are not important.

Problem: There can be too many (exponentially many) colorings.

(16)

Colorings of the clique

For a subgraph

H

, let

C

H be those colors that are used in the precoloring inside

H

.

PSfrag replacements

precolored

We do not have to distinguish between and since colors not in

C

H can be freely permuted.

(17)

Colorings of the clique

For a subgraph

H

, let

C

H be those colors that are used in the precoloring inside

H

.

PSfrag replacements

precolored

We do not have to distinguish between and since colors not in

C

H can be freely permuted.

We do not have to distinguish between and either: outside

H

no vertex is precolored with

C

H (1-PREXT!), thus the colors can be freely permuted.

Idea 2: The only important thing in a coloring of the clique is which vertices receive colors from

C

H, and which vertices receive colors not in

C

H.

(18)

The set system

Let

H

be a graph with a distinguished clique

K

. Set system

S (H, K )

contains

S ⊆ K

if and only if there is a precoloring extension on

H

such that

vertices in

S

receive colors from

C

H,

vertices not in

S

receive colors not in

C

H. Example:

PSfrag replacements

x

z

y K

C

H

= { • , • }

(19)

The set system

Let

H

be a graph with a distinguished clique

K

. Set system

S (H, K )

contains

S ⊆ K

if and only if there is a precoloring extension on

H

such that

vertices in

S

receive colors from

C

H,

vertices not in

S

receive colors not in

C

H. Example:

PSfrag replacements

x

z

y K

C

H

= { • , • }

(20)

The set system

Let

H

be a graph with a distinguished clique

K

. Set system

S (H, K )

contains

S ⊆ K

if and only if there is a precoloring extension on

H

such that

vertices in

S

receive colors from

C

H,

vertices not in

S

receive colors not in

C

H. Example:

PSfrag replacements

x

z

y K

C

H

= { • , • }

PSfrag replacements

{ x, y }

{ x, y } { x, y } { y, z }

{ y, z }

{ y, z }

S (H, K ) = { { x, y } , { y, z } }

(21)

Representing the set systems

For each subgraph

H

appearing in the tree decomposition, we determine the set system

S (H, K )

.

Problem: Size of

S (H, K )

can be exponentially large.

(22)

Representing the set systems

For each subgraph

H

appearing in the tree decomposition, we determine the set system

S (H, K )

.

Problem: Size of

S (H, K )

can be exponentially large.

Idea 3: The set system

S (H, K )

can be compactly represented by network flows.

PSfrag replacements

the clique

K

sinks

Sets in

S (H, K ) m

Maximum flows in the network

(23)

Representing the set systems

For each subgraph

H

appearing in the tree decomposition, we determine the set system

S (H, K )

.

Problem: Size of

S (H, K )

can be exponentially large.

Idea 3: The set system

S (H, K )

can be compactly represented by network flows.

PSfrag replacements 0 0

0 0 0 1

1 1 1 1

the clique

K

sinks

Sets in

S (H, K ) m

Maximum flows in the network

(24)

Representing the set systems

For each subgraph

H

appearing in the tree decomposition, we determine the set system

S (H, K )

.

Problem: Size of

S (H, K )

can be exponentially large.

Idea 3: The set system

S (H, K )

can be compactly represented by network flows.

PSfrag replacements 1

1 1 0

0

0 0 0 0 0

the clique

K

sinks

Sets in

S (H, K ) m

Maximum flows in the network

(25)

Representing the set systems

For each subgraph

H

appearing in the tree decomposition, we determine the set system

S (H, K )

.

Problem: Size of

S (H, K )

can be exponentially large.

Idea 3: The set system

S (H, K )

can be compactly represented by network flows.

PSfrag replacements 1

1 1 0

0

0 0 0 0 0

the clique

K

sinks

Sets in

S (H, K ) m

Maximum flows in the network

Theorem:

S (H, K )

is the projection of the basis set of a matroid.

(26)

Building the networks

When we build the graph with the add, forget, and join operations, we can build at the same time the networks representing the set systems.

In the case of join, we use the following lemma:

S ∈ S ( G, K ) m

S

can be partitioned into

S

1 and

S

2 such that

S

1

∈ S ( G

1

, K )

and

S

2

∈ S ( G

2

, K )

(+ some technical condition holds)PSfrag replacements

G

G

2

G

1

(27)

Building the networks

When we build the graph with the add, forget, and join operations, we can build at the same time the networks representing the set systems.

In the case of join, we use the following lemma:

S ∈ S ( G, K ) m

S

can be partitioned into

S

1 and

S

2 such that

S

1

∈ S ( G

1

, K )

and

S

2

∈ S ( G

2

, K )

(+ some technical condition holds)PSfrag replacements

S(G

1

, K ) S (G

2

, K )

(28)

Building the networks

When we build the graph with the add, forget, and join operations, we can build at the same time the networks representing the set systems.

In the case of join, we use the following lemma:

S ∈ S ( G, K ) m

S

can be partitioned into

S

1 and

S

2 such that

S

1

∈ S ( G

1

, K )

and

S

2

∈ S ( G

2

, K )

(+ some technical condition holds)PSfrag replacements

S(G

1

, K ) S (G

2

, K )

(29)

Building the networks

When we build the graph with the add, forget, and join operations, we can build at the same time the networks representing the set systems.

In the case of join, we use the following lemma:

S ∈ S ( G, K ) m

S

can be partitioned into

S

1 and

S

2 such that

S

1

∈ S ( G

1

, K )

and

S

2

∈ S ( G

2

, K )

(+ some technical condition holds)

PSfrag replacements

S

1

S

2

S(G

1

, K ) S (G

2

, K )

(30)

Building the networks

When we build the graph with the add, forget, and join operations, we can build at the same time the networks representing the set systems.

In the case of join, we use the following lemma:

S ∈ S ( G, K ) m

S

can be partitioned into

S

1 and

S

2 such that

S

1

∈ S ( G

1

, K )

and

S

2

∈ S ( G

2

, K )

(+ some technical condition holds)

PSfrag replacements

S

2

S

1

S = S

1

∪ S

2

S(G

1

, K ) S (G

2

, K )

(31)

The algorithm

Algorithm for 1-PREXT on chordal graphs:

Find a tree decomposition of

G

.

For each subgraph

H

in the tree decomposition, construct a network representing

S ( H, K )

.

The network for

G

can be used to determine whether there is a precoloring extension for

G

or not.

(32)

A non-matroidal example

If the graph is not chordal, then the set system may not be the projection of a matroid:

PSfrag replacements

z

y x

There are 4 possible colorings:

S (G, K ) = { { x } , { y, z } }

(33)

Summary

Special case 1-PREXT of PREXT.

Previous result: 1-PREXT is polynomial-time solvable for interval graphs.

Our result: 1-PREXT is polynomial-time solvable for chordal graphs.

Set system

S( H, K )

is the projection of a matroid if the graph is chordal.

If the graph is not chordal, the this set system is not necessarily a matroid.

(34)

Summary

Special case 1-PREXT of PREXT.

Previous result: 1-PREXT is polynomial-time solvable for interval graphs.

Our result: 1-PREXT is polynomial-time solvable for chordal graphs.

Set system

S( H, K )

is the projection of a matroid if the graph is chordal.

If the graph is not chordal, the this set system is not necessarily a matroid.

Thank you for your attention!

Questions?

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

I examine the structure of the narratives in order to discover patterns of memory and remembering, how certain parts and characters in the narrators’ story are told and

Note that the anisotropic Hilbert spaces used in this work may be ex- tended to the case of parabolic Sobolev spaces built on L p ; p ¤ 2: An idea for this extension can be found

2 On the other hand, data were also preserved in the Beishi ( 北史 ). 3 Ligeti supposed that this list had to be composed cca. 4 This can support the idea that the Chinese list

Originally based on common management information service element (CMISE), the object-oriented technology available at the time of inception in 1988, the model now demonstrates

In this article, I discuss the need for curriculum changes in Finnish art education and how the new national cur- riculum for visual art education has tried to respond to

Although this is a still somewhat visionary possibility of solving the

The idea of the algorithm is that it computes SDist for each possible median string (all combinations with length of l) and picks the best.. For each possible median

In the case of a-acyl compounds with a high enol content, the band due to the acyl C = 0 group disappears, while the position of the lactone carbonyl band is shifted to