Antibandwidth and Cyclic Antibandwidth of Meshes and Hypercubes André Raspaud, Ondrej Sýkora, Heiko Schröder, Ľubomír Török, Imrich Vrťo.

Slides:

Advertisements

Similar presentations

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.

Advertisements

Chapter 8 Topics in Graph Theory

Definitions Distance Diameter Radio Labeling Span Radio Number Gear Graph.

Uniquely Bipancyclic Graphs Zach Walsh. Research REU at University of West Georgia Advisor Dr. Abdollah Khodkar Research partners Alex Peterson and Christina.

What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,

1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.

 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.

GOLOMB RULERS AND GRACEFUL GRAPHS

Friendly Partitions of Graphs Jenna Huston Advised by Dr. David Offner.

Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.

Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

The Theory of NP-Completeness

Graph Colouring Lecture 20: Nov 25.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

Dean H. Lorenz, Danny Raz Operations Research Letter, Vol. 28, No

CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.

Coloring Algorithms and Networks. Coloring2 Graph coloring Vertex coloring: –Function f: V  C, such that for all {v,w}  E: f(v)  f(w) Chromatic number.

Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.

The Maximum Independent Set Problem Sarah Bleiler DIMACS REU 2005 Advisor: Dr. Vadim Lozin, RUTCOR.

K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.

1/22/03Tucker, Applied Combinatorics, Section EDGE COUNTING TUCKER, APPLIED COMBINATORICS, SECTION 1.3, GROUP B Michael Duquette & Amanda Dargie.

Introduction to Graph Theory

9.2 Graph Terminology and Special Types Graphs

GRAPH Learning Outcomes Students should be able to:

Distance Approximating Trees in Graphs

MCS312: NP-completeness and Approximation Algorithms

Graph Theory Topics to be covered:

GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,

1 Treewidth, partial k-tree and chordal graphs Delpensum INF 334 Institutt fo informatikk Pinar Heggernes Speaker:

Advanced Algorithm Design and Analysis (Lecture 13) SW5 fall 2004 Simonas Šaltenis E1-215b

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Fan-planar Graphs: Combinatorial Properties and Complexity results Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani,

1 CS104 : Discrete Structures Chapter V Graph Theory.

1 Steiner Tree Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.

Patrolling Games Katerina Papadaki London School of Economics with Alec Morton and Steven Alpern.

Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Basic Notions on Graphs. The House-and-Utilities Problem.

1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.

NP-COMPLETE PROBLEMS. Admin  Two more assignments…  No office hours on tomorrow.

CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness and course wrap up.

The Dominating Set and its Parametric Dual  the Dominated Set  Lan Lin prepared for theory group meeting on June 11, 2003.

WK15. Vertex Cover and Approximation Algorithm By Lin, Jr-Shiun Choi, Jae Sung.

Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.

Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems A. Brandstaedt, F.F. Dragan, H.-O. Le and V.B. Le University of Rostock, Germany.

Graph Theory and Applications

Shortest Path Based Sufficiency Condition for Hamiltonian Graphs

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

Strings Basic data type in computational biology A string is an ordered succession of characters or symbols from a finite set called an alphabet Sequence.

GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,

 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.

Basic properties Continuation

CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 5.

Introduction to NP Instructor: Neelima Gupta 1.

Kernel Bounds for Path and Cycle Problems Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch September 8 th 2011, Saarbrucken.

Approximation Algorithms by bounding the OPT Instructor Neelima Gupta

The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.

1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.

ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.

Introduction to the Design and Analysis of Algorithms

Graphs: Definitions and Basic Properties

Proof technique (pigeonhole principle)

Graph theory Definitions Trees, cycles, directed graphs.

Miniconference on the Mathematics of Computation

Simple Graphs: Connectedness, Trees

Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)

Treewidth meets Planarity

Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)

Presentation transcript:

Antibandwidth and Cyclic Antibandwidth of Meshes and Hypercubes André Raspaud, Ondrej Sýkora, Heiko Schröder, Ľubomír Török, Imrich Vrťo

Dedicated to memory of Ondrej Sýkora 

Antibandwidth problem Consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximized. Just another labeling problem (from graph theory point of view)

Confusing terminology Originally studied under the term separation number (Leung, Vornberger, On some variants of the bandwidth minimization problem) Dual bandwidth (Lin, Yuan) We propose (best and hopefully final) term: antibandwidth

Previous results NP-complete (Leung, Vornberger) Polynomially solvable for the complements of –Interval –Arborescent comparability –Treshold graphs. (Donnely, Isaak, Hamiltonian powers in … graphs)

Previous results Exact results for: –Paths, cycles, special trees, complete and complete bipartite graphs Also interesting for disconnected graphs. –Exact values for graphs consisting of copies of simple graphs.

Previous results m x n mesh,, (Miller, Pritikin,On the separation number of graphs) N-dimensional hypercube (Miller, Pritikin,…)

Our contribution Upper bound method suitable for bipartite graphs Improving bounds for hypercubes and meshes:

Our contribution Toroidal meshes : –Even n: –Odd n:

Meshes: upper bound Definition: Let be a bipartition. Minimal vertex boundary of a set is a set of all vertices from having neighbour in A. Proof based on result of Bezrukov and Piotrowski (minimal bipartite vertex boundary of mesh)

Meshes: lower bound Showed in Miller, Pritikin, On separation number of graphs

Even torus Optimal numbering for even torus

Odd torus Optimal numbering of odd torus

Hypercube Vertices of can be partitioned into sets according to their distance from the vertex Edges are only between and.

Cyclic antibandwidth The vertices are mapped bijectively into such that the minimal distance, measured in cycle, of adjacent vertices is maximized. We provide: –General lower bound –Values for meshes, tori and hypercubes

General bounds Upper bound Lower bound

Cyclic antibandw. of meshes m even, n odd, then Otherwise

Cyclic antibandw. of meshes Another optimal numbering of mesh comparing the antibandwidth part

Cyclic antibandw. of meshes Way of proof –To show that previous numbering is also ab- optimal –Computing the length of the longest edge in this labeling –Getting the lower bound value from general formula

Cyclic antibandw. of tori Even torus Odd torus

Cyclic antibandw. of hypercube Similar way of proof as for mesh

Conclusion Antibandwidth –Improved bounds for meshes and hypercubes –Results for toroidal meshes Cyclic antibandwidth –General bounds based on antibandwidth –Results for meshes, hypercubes and toroidal meshes

The End Thank You