Combinatorial algorithms for graphs and partially ordered sets - PowerPoint PPT Presentation

Introduction The order dimension of planar maps Summary Combinatorial algorithms for graphs and partially ordered sets Johan Nilsson BRICS University of Aarhus PhD defence Aarhus October 15, 2007 1 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction The order dimension of planar maps Summary Outline Introduction 1 Outline of the thesis Poset dimension Vertex-edge-face posets and vertex-face posets The order dimension of planar maps 2 Brightwell and Trotter’s results The dimension of V-E-F posets The dimension of vertex-face posets 2 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Outline Introduction 1 Outline of the thesis Poset dimension Vertex-edge-face posets and vertex-face posets The order dimension of planar maps 2 Brightwell and Trotter’s results The dimension of V-E-F posets The dimension of vertex-face posets 3 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets The dissertation consists of four parts: Reachability oracles 1 Reachability substitutes 2 The order dimension of planar maps 3 Approximation algorithms for graphs with large treewidth 4 4 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Partially ordered sets A partially ordered set (poset) is a pair P = ( X , P ) of a ground set X (the elements of the poset) and a binary relation P on X that is transitive ( a ≤ b and b ≤ c implies a ≤ c ), reflexive ( a ≤ a ) and antisymmetric ( a ≤ b implies b �≤ a ( a � = b )) 6 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Diagrams Posets are often represented by their diagrams. Example a b c ≤ a , d ≤ a , c d e ≤ d , d ≤ b e 7 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Linear extensions Let P = ( P , X ) be a poset. Definition A linear extension L of P is a linear order that is an extension of P , i.e., x ≤ P y ⇒ x ≤ L y . 8 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Linear extensions Example a b a c c d b d e e 9 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Dimension Definition A family of linear extensions R = { L 1 , L 2 , . . . , L t } of P is a realizer of P if P = ∩R . The dimension of P is the minimum cardinality of a realizer of P . 10 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Dimension Example a b a b c a c d b d d e e e c 11 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Why is dimension interesting? Measures how close a poset is to being a linear order. Low dimension implies a compact representation. Example a → ( 5 , 4 ) d → ( 2 , 3 ) e → ( 1 , 2 ) b → ( 3 , 5 ) c → ( 4 , 1 ) 12 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Planar maps A planar map is the sets of vertices (points), edges (lines) and faces (regions) of a crossing-free drawing of a graph in the plane and the incidences between those sets. The dual map M ∗ of a planar map M is a planar map with a vertex for each face in M and a face for each vertex in M like in this example. 14 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Planar maps Example M M ∗ 15 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Outerplanar maps If all the vertices are on the outer face, the map is strongly outerplanar. If there is a different drawing of the same graph where all the vertices are on the outer face, the map is weakly outerplanar. Example 16 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Vertex-edge-face and vertex-face posets Definition The vertex-edge-face poset P M of a planar map M is the poset on the vertices, edges and faces of M ordered by inclusion. The vertex-face poset Q M of M is the subposet of P M induced by the vertices and faces of M . 17 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Outline of the thesis The order dimension of planar maps Poset dimension Summary Vertex-edge-face posets and vertex-face posets Vertex-edge-face and vertex-face posets Example F ∆ F ∞ Q M M F ∆ F ∞ P M 18 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Brightwell and Trotter’s results The order dimension of planar maps The dimension of V-E-F posets Summary The dimension of vertex-face posets Outline Introduction 1 Outline of the thesis Poset dimension Vertex-edge-face posets and vertex-face posets The order dimension of planar maps 2 Brightwell and Trotter’s results The dimension of V-E-F posets The dimension of vertex-face posets 19 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Brightwell and Trotter’s results The order dimension of planar maps The dimension of V-E-F posets Summary The dimension of vertex-face posets The Brightwell-Trotter Theorems Theorem (Brightwell & Trotter) Let M be a planar map. Then dim ( P M ) ≤ 4 . Theorem (Brightwell & Trotter) Let M be a 3-connected planar map. Then dim ( Q M ) = 4 . 20 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Introduction Brightwell and Trotter’s results The order dimension of planar maps The dimension of V-E-F posets Summary The dimension of vertex-face posets Two questions of Brightwell and Trotter For which planar maps is dim ( P M ) ≤ 3? 1 For which planar maps is dim ( Q M ) ≤ 3? 2 We know when the dimension is at most 2. 21 Johan Nilsson Combinatorial algorithms for graphs and partially ordered sets

Combinatorial algorithms for graphs and partially ordered sets - PowerPoint PPT Presentation

Introduction The order dimension of planar maps Summary Combinatorial algorithms for graphs and partially ordered sets Johan Nilsson BRICS University of Aarhus PhD defence Aarhus October 15, 2007 1 Johan Nilsson Combinatorial algorithms

Improved Ramsey-type results in comparability graphs D aniel Kor andi EPFL May 14, 2019

EPIMORPHISMS IN CERTAIN VARIETIES OF PARTIALLY ORDERED SEMIGROUPS SOHAIL NASIR Dedicated to my

Analysis Analysis y input size input quality (partially ordered) input quality

Learning Monotone Partitions of Partially-Ordered Domains Oded Maler VERIMAG CNRS and the

G14FUN: Functional Analysis, Introductory material on totally ordered sets and partially ordered

W4231: Analysis of Algorithms Graphs 10/21/1999 (revised 10/25) A graph G is given by a set of

W4231: Analysis of Algorithms Graphs 10/21/1999 A graph G is given by a set of vertices V and a

Causal set is a partially ordered set defined as: a b if and only if one can travel from a to b

Lecture 4.3: Partially ordered sets Matthew Macauley Department of Mathematical Sciences Clemson

House of Graphs a database of interesting graphs G. Brinkmann K. Coolsaet J. Goedgebeur* H.

Graphs Graphs Simple graphs Algorithms Depth-first search Breadth-first search

How to Tell When a Product Similar Questions in . . . Definitions of Two Partially Ordered Main

On cubic 4-ordered graphs and cubic 4-ordered Hamiltonian graphs Hamiltonian graphs Lih-Hsing

Learning with Partially Ordered Representations Jonathan Rawski Department of Linguistics IACS

Efficient Algorithms P and NP So far, we have developed algorithms for finding shortest

Mining Temporal Invariants from Partially Ordered Logs Ivan Beschastnikh Yuriy Brun University

Partially Ordered Sets and their M obius Functions III: Topology of Posets Bruce Sagan

Partially Ordered Sets and their M obius Functions I: The M obius Inversion Theorem Bruce

Planarity for Partially Ordered Sets William T. Trotter trotter@math.gatech.edu Challenge

Chapter 4 Programming with MATLAB Algorithms and Control Structures Algorithm: an ordered

M obius Functions of Posets I: Introduction to Partially Ordered Sets Bruce Sagan Department

Partially Ordered Sets and their M obius Functions II: Graph Coloring Bruce Sagan Department

ordered-neighborhood graphs l 47pt NeurIPS PS confere renc nce (poster er #122)

General Methods and Search 2. Generic Approaches to Combinatorial Optimization Algorithms 3.