Directed acyclic graphs with the unique dipath property J.-C. Bermond, M. Cosnard, S. Perennes Inria and CNRS 24 Nov. 20111Disco Workshop - Valparaiso.

Slides:



Advertisements
Similar presentations
Algorithm Design Methods Spring 2007 CSE, POSTECH.
Advertisements

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Cpt S 223 – Advanced Data Structures Graph Algorithms: Introduction
Optimization Problems in Optical Networks. Wavelength Division Multiplexing (WDM) Directed: Symmetric: Undirected: Optic Fiber.
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Edge-connectivity and super edge-connectivity of P 2 -path graphs Camino Balbuena, Daniela Ferrero Discrete Mathematics 269 (2003) 13 – 20.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Bipartite Matching, Extremal Problems, Matrix Tree Theorem.
Lauritzen-Spiegelhalter Algorithm
EMIS 8374 Vertex Connectivity Updated 20 March 2008.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 8 Network models.
Wavelength Division Multiplexing (WDM) in Optical Networks: Modeled as a Graph Coloring Problem By Joshua Schoenly.
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
NP-Complete Problems Problems in Computer Science are classified into
Graph Theory Ch.5. Coloring of Graphs 1 Chapter 5 Coloring of Graphs.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
MCS312: NP-completeness and Approximation Algorithms
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
Linear Programming Data Structures and Algorithms A.G. Malamos References: Algorithms, 2006, S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani Introduction.
Incidentor coloring: methods and results A.V. Pyatkin "Graph Theory and Interactions" Durham, 2013.
 Rooted tree and binary tree  Theorem 5.19: A full binary tree with t leaves contains i=t-1 internal vertices.
1 Multicasting in a Class of Multicast-Capable WDM Networks From: Y. Wang and Y. Yang, Journal of Lightwave Technology, vol. 20, No. 3, Mar From:
© 2004 Goodrich, Tamasia Recall: Digraphs A digraph is a graph whose edges are all directed Short for “directed graph” Applications one-way streets flights.
Data Structures & Algorithms Graphs
10. Lecture WS 2006/07Bioinformatics III1 V10: Network Flows V10 follows closely chapter 12.1 in on „Flows and Cuts in Networks and Chapter 12.2 on “Solving.
COSC 2007 Data Structures II Chapter 14 Graphs I.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 25.
Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge.
Graphs Lecture 2. Graphs (1) An undirected graph is a triple (V, E, Y), where V and E are finite sets and Y:E g{X V :| X |=2}. A directed graph or digraph.
8.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of.
Chromatic Coloring with a Maximum Color Class Bor-Liang Chen Kuo-Ching Huang Chih-Hung Yen* 30 July, 2009.
COMPSCI 102 Introduction to Discrete Mathematics.
A directed graph G consists of a set V of vertices and a set E of arcs where each arc in E is associated with an ordered pair of vertices from V. V={0,
5.6 Prefix codes and optimal tree Definition 31: Codes with this property which the bit string for a letter never occurs as the first part of the bit string.
1 GRAPHS – Definitions A graph G = (V, E) consists of –a set of vertices, V, and –a set of edges, E, where each edge is a pair (v,w) s.t. v,w  V Vertices.
Maryam Pourebadi Kent State University April 2016.
ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.
The Theory of NP-Completeness
Graphs Lecture 19 CS2110 – Spring 2013.
Basic Concepts Graphs For more notes and topics visit:
Graph theory Definitions Trees, cycles, directed graphs.
V12: Network Flows V12 follows closely chapter 12.1 in
Flow in Network.
The Taxi Scheduling Problem
Structural graph parameters Part 2: A hierarchy of parameters
3.3 Applications of Maximum Flow and Minimum Cut
ICS 353: Design and Analysis of Algorithms
Graphs Lecture 18 CS2110 – Fall 2009.
Network Flow and Connectivity in Wireless Sensor Networks
Maximum Flows of Minimum Cost
CS223 Advanced Data Structures and Algorithms
Chapter 9: Graphs Basic Concepts
R. Johnsonbaugh Discrete Mathematics 5th edition, 2001
Problem Solving 4.
Activity Networks
Activity Networks
V13 Network Flows This part follows closely chapter 12.1 in the book on the right on „Flows and Cuts in Networks and Chapter 12.2 on “Solving the Maximum-Flow.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Flow Feasibility Problems
Text Book: Introduction to algorithms By C L R S
Discrete Mathematics for Computer Science
Chapter 9: Graphs Basic Concepts
Locality In Distributed Graph Algorithms
Presentation transcript:

Directed acyclic graphs with the unique dipath property J.-C. Bermond, M. Cosnard, S. Perennes Inria and CNRS 24 Nov Disco Workshop - Valparaiso 2011 For ERIC – Happy 60th Birthday

24 Nov. 2011Disco Workshop - Valparaiso 20112

24 Nov. 2011Disco Workshop - Valparaiso 20113

Introduction Routing, wavelength assignment and grooming in optical networks. Generic problem : satisfy a family of requests (or a traffic matrix) under capacity constraints request Objectives : Minimize the load of the routing (number of paths sharing an edge) Minimize the number of wavelengths (two dipaths sharing an arc have to be assigned different wavelengths) 24 Nov. 2011Disco Workshop - Valparaiso 20114

Introduction minimum wavelength number >= minimum routing load Minimizing the load or the number of wavelengths is a difficult problem (NP-hard). min wave number = min routing load if – General graph and multicast – Symmetric tree and all to all Even in the case of a family of dipaths, min wave number is NP-hard (= chromatic number of the conflict graph). 24 Nov. 2011Disco Workshop - Valparaiso 20115

Introduction For directed trees and any sets of requests (family of digraphs), it can be shown that min wave numb = min routing load Can this result be generalized to arbitrary Directed Acyclic Graphs ? 24 Nov. 2011Disco Workshop - Valparaiso 20116

7 A pathological example S1 S2 S3 S4 T4 T3 T2 T1 Requests : (S1,T1), (S2,T2), (S3,T3), (S4,T4) Minimum load = 2 : each path will cross at least another one Minimum number of wavelengths = 4 : each path will cross all the other paths. 24 Nov. 2011

Disco Workshop - Valparaiso A pathological example S1 S2 S3 S4 T4 T3 T2 T1 Requests : (S1,T1), (S2,T2), (S3,T3), (S4,T4) 24 Nov. 2011

Disco Workshop - Valparaiso A pathological example S1 S2 S3 S4 T4 T3 T2 T1 Requests : (S1,T1), (S2,T2), (S3,T3), (S4,T4) 24 Nov. 2011

Disco Workshop - Valparaiso A pathological example S1 S2 S3 S4 T4 T3 T2 T1 Requests : (S1,T1), (S2,T2), (S3,T3), (S4,T4) 24 Nov. 2011

Disco Workshop - Valparaiso A pathological example S1 S2 S3 S4 T4 T3 T2 T1 Requests : (S1,T1), (S2,T2), (S3,T3), (S4,T4) min load = 2 and min number wavelengths = 4. Can be generalized to min load = 2 and min number wavelengths = n. 24 Nov. 2011

Disco Workshop - Valparaiso Definitions S1 S2 S3 S4 T4 T3 T2 T1 A DAG (Directed Acyclic Graph) is a digraph with no directed cycle. An (oriented) cycle in a DAG consists of a sequence of dipaths P1, P2,..., P2k alternating in direction An internal cycle of a DAG G is an oriented cycle such that no vertex is a source or a sink. 24 Nov. 2011

Disco Workshop - Valparaiso Definitions Given a digraph G and a family of dipaths P, the load of an arc e is the number of dipaths of the family containing e load(G,P, e) = |{P : P ∈ P; e ∈ P}| The load of G for P π(G,P) is the maximum over all the arcs of G. Two dipaths are in conflict (or intersect) if they share an arc. w(G,P) is the minimum number of colors needed to color the dipaths of P in such a way that two dipaths in conflict have different colors. π(G,P) ≤ w(G,P). 24 Nov. 2011

Disco Workshop - Valparaiso Definitions and properties The conflict graph of (G,P) is a graph whose vertices are the dipaths of P, two vertices being joined if their associated dipaths are in conflict. w is the chromatic number of the conflict graph π is upper bounded by the clique number of the conflict graph. 24 Nov. 2011

Disco Workshop - Valparaiso Problems Consider a simplified problem : unique routing. Can we solve the problem of finding the minimum number of wavelenths ? The answer is unknown (pathological example). Given a DAG G and a family of dipaths P, what is the relation between the load of G for P and the minimum number of wavelenths ? Is it possible to characterize the DAGs for which load is equal to the min wave numb ? 24 Nov. 2011

Disco Workshop - Valparaiso Main result Theorem 1 Let G be a DAG. Then, for any family of dipaths P, w(G,P) = π(G,P) if and only if G does not contain an internal cycle. Theorem 2 If a DAG G contains an internal cycle there exists a set P of dipaths such that π(G,P) = 2 and w(G,P) = Nov. 2011

Disco Workshop - Valparaiso Unique path property DAG Definition A DAG has the UP Property if between two vertices there is at most one dipath. A digraph satisfying this property will be called an UPP-DAG. Property If G is an UPP-DAG and if a set of dipaths are pairwise in conflict, then their intersection is a dipath (Helly property). Hence the load is the clique number of the conflict graph. 24 Nov. 2011

Disco Workshop - Valparaiso Unique path property DAG Theorem 3 Let G be an UPP-DAG with only one internal cycle. Then for any family of dipaths P, w(G,P) ≤ ceiling (4/3 π(G,P)) If C is the number of internal cycles of the UPP-graph, then w(G,P) ≤ ceiling ((4/3) C π(G,P)) 24 Nov. 2011

Disco Workshop - Valparaiso Unique path property DAG Theorem 4 There exists an UPP-DAG with only one internal cycle and an infinite family of dipaths P such that : w(G,P) = ceiling (4/3 π(G,P)) 24 Nov. 2011

Disco Workshop - Valparaiso Unique path property DAG Proof : w(G,P) = ceiling (4/3 π(G,P)) A1A’1A2A’2 B1B2 C1C2 D1 D’1 D2 D’2 Dipaths : (A1B1C1D1), (A1B1C2D2), (A2B2C2D2), (A2B2C1D’1), (A’1B1C1D’1), (A’1B1C2D’2), (A’2B2C2D’2), (A’2B2C1D1) A1 A’1A2 A’2 B1 B2 C1C2 D1 D’1D2 D’2 24 Nov. 2011

Disco Workshop - Valparaiso Unique path property DAG Proof : conflict graph If one copy of each dipath π(G,P) = 2 ; w(G,P) = 3 If k copies : π(G,P) = 2k ; w(G,P) = ceiling(8k/3) A1 A’1A2 A’2 B1 B2 C1C2 D1 D’1D2 D’2 A1B1C1D1 A1B1C2D2 A2B2C2D2 A2B2C1D’1 A’1B1C1D’1 A’2B2C1D1 A’2B2C2D’2 A’1B1C2D’2 24 Nov. 2011

Good edge-labelling Edge-labelling: function Φ : E(G)  R. A path is increasing if the sequence of its edges labels is non- decreasing. An edge-labelling of G is good if, for any two distinct vertices u, v, there is at most one increasing (u,v)-path. 24 Nov. 2011Disco Workshop - Valparaiso ab c d a c d b

UPP DAGs with load 2 Theorem 5 G UPP DAG with load 2. For any family of dipaths P, the conflict graph C(G;P) has a good labeling. H graph with a good labeling. There exists an UPP DAG G with load 2 and a family of dipaths P such that H = C(G;P). 24 Nov. 2011Disco Workshop - Valparaiso

UPP DAGs with load 2 Theorem 6 There exist a family of graphs with a good labeling and an arbitrary large chromatic number. There exist UPP digraphs with load 2 and arbitrary large w. 24 Nov. 2011Disco Workshop - Valparaiso

Open Problems Let G be an undirected graph. Is it possible to orient its edges to obtain an UPP DAG ? Bounds in terms of number of internal cycles ? Characterisation of graphs with good labeling (decision problem NP hard (Araujo, Cohen, Giroire,Havet)) UPP DAGS with load 3 or more ?? When w =  ? 24 Nov. 2011Disco Workshop - Valparaiso