a 9 k kernel for nonseparating independent set in planar
play

A 9 k kernel for nonseparating independent set in planar graphs - PowerPoint PPT Presentation

May 15, 2023 •29 likes •359 views

A 9 k kernel for nonseparating independent set in planar graphs Lukasz Kowalik (speaker) and Marcin Mucha Institute of Informatics, University of Warsaw Jerusalem, 27.06.2012 Lukasz Kowalik (Warsaw) A kernel for nonseparating

  1. A 9 k kernel for nonseparating independent set in planar graphs � Lukasz Kowalik (speaker) and Marcin Mucha Institute of Informatics, University of Warsaw Jerusalem, 27.06.2012 � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 1 / 18

  2. Kernelization (of graph problems) Let ( G , k ) be an instance of a decision problem ( k is a parameter). ( G ′ , k ′ ) Graph G poly-time parameter k | V ( G ′ ) | ≤ f ( k ) Kernel Input instance ( G , k ) is a YES-instance iff ( G ′ , k ′ ) is a YES-instance. k ′ ≤ k , | V ( G ′ ) | ≤ f ( k ). � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 2 / 18

  3. Some examples of kernels General graphs: Vertex Cover 2 k , Feedback Vertex Set O ( k 2 ), Odd Cycle Transversal k O (1) , ... Planar graphs: Dominating Set 67 k , Feedback Vertex Set 112 k , Induced Matching 28 k , Connected Vertex Cover 11 3 k , ... � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 3 / 18

  4. Vertex Cover and Independent Set Let G = ( V , E ) be a graph. � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 4 / 18

  5. Vertex Cover and Independent Set Let G = ( V , E ) be a graph. C is a vertex cover ( ) when every edge has at least one endpoint in C . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 4 / 18

  6. Vertex Cover and Independent Set Let G = ( V , E ) be a graph. C is a vertex cover ( ) when every edge has at least one endpoint in C . S is an independent set ( ) when every edge has at most one endpoint in S . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 4 / 18

  7. Vertex Cover and Independent Set Let G = ( V , E ) be a graph. C is a vertex cover ( ) when every edge has at least one endpoint in C . S is an independent set ( ) when every edge has at most one endpoint in S . Observation C is a vertex cover iff V \ C is an independent set. G has a vertex cover of size k iff G has independent set of size | V | − k . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 4 / 18

  8. Parametric Duality Corollary G has independent set of size k iff G has a vertex cover of size | V | − k . Vertex Cover Instance: Graph G = ( V , E ), k ∈ N Question: Does G contain a vertex cover of size k ? Independent Set Instance: Graph G = ( V , E ), k ∈ N Question: Does G contain an independent set of size k ? We can treat Independent Set as Vertex Cover with | V | − k as a parameter. Then, Vertex Cover is a parametric dual of Independent Set . But a small kernel for one problem does not give a small kernel for another. � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 5 / 18

  9. Connected Vertex Cover & Nonseparating Independent Set Let G = ( V , E ) be a connected graph. � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 6 / 18

  10. Connected Vertex Cover & Nonseparating Independent Set Let G = ( V , E ) be a connected graph. C is a connected vertex cover ( ) when C is a vertex cover and C induces a connected subgraph of G . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 6 / 18

  11. Connected Vertex Cover & Nonseparating Independent Set Let G = ( V , E ) be a connected graph. C is a connected vertex cover ( ) when C is a vertex cover and C induces a connected subgraph of G . S is a nonseparating independent set ( ) when S is an independent set and G − S is connected. � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 6 / 18

  12. Connected Vertex Cover & Nonseparating Independent Set Let G = ( V , E ) be a connected graph. C is a connected vertex cover ( ) when C is a vertex cover and C induces a connected subgraph of G . S is a nonseparating independent set ( ) when S is an independent set and G − S is connected. Observation C is a connected vertex cover iff V \ C is a nonseparating independent set. G has a connected vertex cover of size k iff G has a nonseparating independent set of size | V | − k . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 6 / 18

  13. Parametric Duality Connected Vertex Cover (CVC) Instance: Graph G = ( V , E ), k ∈ N Question: Does G contain a vertex cover of size k ? Nonseparating Independent Set (NSIS) Instance: Graph G = ( V , E ), k ∈ N Question: Does G contain an independent set of size k ? Connected Vertex Cover is a parametric dual of Nonseparating Independent Set . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 7 / 18

  14. Known complexity results for Connected Vertex Cover (CVC) and Nonseparating Independent Set (NSIS) Both problems NP-complete even for planar graphs, in P for graphs of maximum degree 3 (Ueno 1988). CVC: kernelization CVC has no kernel of polynomial size (Dom et al 2009), Planar CVC has a 11 3 k -kernel (Kowalik et al 2011). NSIS: kernelization NSIS is W [1]-hard, so no kernel at all (folklore), Planar NSIS : O ( k )-sized kernel (Fomin et al. 2010) � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 8 / 18

  15. Our results: kernel upper bounds Main Result There is a 9 k -kernel for Planar Nonseparating Independent Set . A Bonus Result (skipped in this presentation) There is a 5 k -kernel for Planar Max Leaf . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 9 / 18

  16. Our results: kernel lower bounds Theorem (Chen et al. 2007) If a problem admits a kernel of size at most α k , then the dual problem has no kernel of size at most ( α − 1 − ǫ ) k , for any ǫ > 0, unless P=NP. α Two corollaries Planar CVC has no kernel of size at most ( 9 8 − ǫ ) k , unless P=NP, Planar Connected Dominating Set has no kernel of size at most ( 5 4 − ǫ ) k , unless P=NP, � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 10 / 18

  17. A simple 12 k kernel for Planar NSIS For a tree T let L ( T ) denote the set of leaves of T . Maximum Independent Leaf Instance: Graph G = ( V , E ), k ∈ N Question: Is there a spanning tree T such that L ( T ) contains a subset of size k that is independent in G ? Observation Connected graph G has a nonseparating independent set of size k iff G has a spanning tree T such that L ( T ) contains a subset S of size k that is independent in G . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 11 / 18

  18. A simple 12 k kernel for Planar NSIS For a tree T let L ( T ) denote the set of leaves of T . Maximum Independent Leaf Instance: Graph G = ( V , E ), k ∈ N Question: Is there a spanning tree T such that L ( T ) contains a subset of size k that is independent in G ? Observation Connected graph G has a nonseparating independent set of size k iff G has a spanning tree T such that L ( T ) contains a subset S of size k that is independent in G . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 11 / 18

  19. A simple 12 k kernel for Planar NSIS For a tree T let L ( T ) denote the set of leaves of T . Maximum Independent Leaf Instance: Graph G = ( V , E ), k ∈ N Question: Is there a spanning tree T such that L ( T ) contains a subset of size k that is independent in G ? Observation Connected graph G has a nonseparating independent set of size k iff G has a spanning tree T such that L ( T ) contains a subset S of size k that is independent in G . � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 11 / 18

  20. A simple 12 k kernel for Planar NSIS For a tree T let L ( T ) denote the set of leaves of T . Maximum Independent Leaf Instance: Graph G = ( V , E ), k ∈ N Question: Is there a spanning tree T such that L ( T ) contains a subset of size k that is independent in G ? Observation Connected graph G has a nonseparating independent set of size k iff G has a spanning tree T such In what follows... that L ( T ) contains a subset S of size k that is independent in G . we focus on Maximum Independent Leaf ! � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 11 / 18

  21. A 12 k -kernel for Planar NSIS for minimum degree 3 � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 12 / 18

  22. A 12 k -kernel for Planar NSIS for minimum degree 3 Theorem (Kleitman, West 1991) Every n -vertex graph of minimum degree 3 has a spanning tree of ≥ n / 4 leaves. = leaves. � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 12 / 18

  23. A 12 k -kernel for Planar NSIS for minimum degree 3 Theorem (Kleitman, West 1991) Every n -vertex graph of minimum degree 3 has a spanning tree of ≥ n / 4 leaves. Observation If G is planar and T is a spanning tree of G then G [ L ( T )] is outerplanar. = leaves. � Lukasz Kowalik (Warsaw) A kernel for nonseparating independent set... Jerusalem, 27.06.2012 12 / 18

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Independent sets in triangle-free planar graphs rk 1 M. Mnich 2 Z. Dvo 1 CSI, Charles

Independent sets in triangle-free planar graphs rk 1 M. Mnich 2 Z. Dvo 1 CSI, Charles

Independent sets in triangle-free planar graphs rk 1 M. Mnich 2 Z. Dvo 1 CSI, Charles University, Prague 2 Saarbrcken STRUCO meeting, 2013 Z. Dvo rk, M. Mnich Independent sets in triangle-free planar graphs Independent sets in planar

727 views • 29 slides
Planar Subdivision Let G =( V , E ) be an undirected graph. G is planar if it can be embedded

Planar Subdivision Let G =( V , E ) be an undirected graph. G is planar if it can be embedded

Planar Subdivision Let G =( V , E ) be an undirected graph. G is planar if it can be embedded in the plane without edge crossings. planar K 5 , not planar K 3,3 , not planar A planar embedding (=drawing) of a planar graph G induces

266 views • 5 slides
Planar graphs are 9 / 2-colorable and have big independent sets Daniel W. Cranston Virginia

Planar graphs are 9 / 2-colorable and have big independent sets Daniel W. Cranston Virginia

Planar graphs are 9 / 2-colorable and have big independent sets Daniel W. Cranston Virginia Commonwealth University dcranston@vcu.edu Joint with Landon Rabern Slides available on my webpage Math Department Colloquium George Washington 6

1.41k views • 127 slides
Planar Algebras and Subfactors Tangle Planar algebra Connection with subfactor Subfactor

Planar Algebras and Subfactors Tangle Planar algebra Connection with subfactor Subfactor

What is a planar algebra? Connection with subfactor A canonical MASA (maximal abelian self-adjoint subalgebra) Planar Algebras and Subfactors Arnaud Brothier What is a planar algebra? Planar calculus Planar Algebras and Subfactors Tangle

568 views • 40 slides
Rectangular Planar Array wher e, Rectangular Planar Array an where k = 2 / d The

Rectangular Planar Array wher e, Rectangular Planar Array an where k = 2 / d The

Rectangular Planar Array wher e, Rectangular Planar Array an where k = 2 / d The principal maximum(m = n = 0) and grating lobes can be located by: m = 0, 1, 2,. n = 0, 1, 2,. Radiation Pattern of 5x5 Planar Array

667 views • 29 slides
A master bijection for planar maps and its applications Olivier Bernardi (MIT) Joint work with

A master bijection for planar maps and its applications Olivier Bernardi (MIT) Joint work with

A master bijection for planar maps and its applications Olivier Bernardi (MIT) Joint work with Eric Fusy (CNRS/LIX) UCLA, March 2011 Planar maps. Definition A planar map is a connected planar graph embedded in the sphere considered up to

720 views • 60 slides
8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the

8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the

8.7.1 Section 8.7 Planar Graphs 8.7 PLANAR GRAPHS def: A graph is planar if it can be drawn with- out edge-crossings in the plane. Given a graph G and a Imbedding Problem: surface S , is it possible to draw G on S without any

372 views • 18 slides
Planar Pixel Sensor Production at CiS Planar Pixel Sensor Production at CiS Anna Macchiolo - MPP

Planar Pixel Sensor Production at CiS Planar Pixel Sensor Production at CiS Anna Macchiolo - MPP

Planar Pixel Sensor Production at CiS Planar Pixel Sensor Production at CiS Anna Macchiolo - MPP Munich 009 g, 5 th June 20 Project aimed to explore the possible range of application in fluence (hence detector radii) for planar pixels

352 views • 23 slides
LAGOS 2017 Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Isidoro

LAGOS 2017 Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Isidoro

Almost-planar graphs Deltawye reduction of almost-planar graph Almost-planar graphs on the projective plane Deltawye reduction with terminals of almost-planar graphs Future Research LAGOS 2017 Delta-Wye Transformations and the Efficient

1.3k views • 45 slides
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering Manuel

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering Manuel

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering Manuel Fernndez V, David P. Woodruff, Taisuke Yasuda Kernel Method Many machine learning tasks can be expressed as a function of the inner product

389 views • 22 slides
1 Kernel methods & optimization One example of a kernel that is frequently used in practice

1 Kernel methods & optimization One example of a kernel that is frequently used in practice

Machine Learning Class Notes 9-25-12 Prof. David Sontag 1 Kernel methods & optimization One example of a kernel that is frequently used in practice and which allows for highly non-linear discriminant functions is the Gaussian kernel,

240 views • 5 slides
1-Fan-Bundle-Planar Drawings of Graphs Patrizio Angelini Michael A. Bekos Michael Kaufmann

1-Fan-Bundle-Planar Drawings of Graphs Patrizio Angelini Michael A. Bekos Michael Kaufmann

1-Fan-Bundle-Planar Drawings of Graphs Patrizio Angelini Michael A. Bekos Michael Kaufmann Philipp Kindermann Thomas Schneck Beyond Planarity Planar Beyond Planarity 1-planar Beyond Planarity 2-planar Beyond Planarity k -planar Beyond

2.19k views • 162 slides
Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California,

Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California,

Cubic Planar Graphs That Cannot Be Drawn On Few Lines David Eppstein University of California, Irvine Symposium on Computational Geometry, June 2019 Planar graph drawing on one line Always possible using 2 semicircles per edge Planar graph

432 views • 16 slides
Enumeration and uniform sampling of planar structures Mihyun Kang Institut fr Informatik

Enumeration and uniform sampling of planar structures Mihyun Kang Institut fr Informatik

Enumeration and uniform sampling of planar structures Mihyun Kang Institut fr Informatik Humboldt-Universitt zu Berlin Planar structures Planar structures are classes of graphs that are embeddable in the plane: Trees : K 3 minor-free

1.41k views • 119 slides
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering Manuel

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering Manuel

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering Manuel Fernndez V, David P. Woodruff, Taisuke Yasuda Overview Preliminaries Kernel ridge regression Kernel -means clustering

476 views • 25 slides
Debugging the Linux Kernel with GDB Kieran Bingham Debugging the Linux Kernel with GDB Many

Debugging the Linux Kernel with GDB Kieran Bingham Debugging the Linux Kernel with GDB Many

Debugging the Linux Kernel with GDB Kieran Bingham Debugging the Linux Kernel with GDB Many of us need to debug the Linux kernel Proprietary tools like Trace32 and DS-5 are $$$ Open source debuggers like GDB lack kernel

884 views • 40 slides
rrs rtstrs

rrs rtstrs

rrs rtstrs rtrst rs r r rst Prrs

780 views • 67 slides
Local Update Algorithms for Random Graphs Romaric Duvignau ees AL Journ EA 2014 March 17,

Local Update Algorithms for Random Graphs Romaric Duvignau ees AL Journ EA 2014 March 17,

Local Update Algorithms for Random Graphs Romaric Duvignau ees AL Journ EA 2014 March 17, 2014 Joint Work with Philippe Duchon Overview Introduction Update Algorithms Deletion Algorithms Insertion Algorithms Conclusion Romaric

1.52k views • 68 slides
Linear Programming solvers: the state of the art Julian Hall School of Mathematics, University of

Linear Programming solvers: the state of the art Julian Hall School of Mathematics, University of

Linear Programming solvers: the state of the art Julian Hall School of Mathematics, University of Edinburgh 4th ISM-ZIB-IMI MODAL Workshop Mathematical Optimization and Data Analysis Tokyo 27 March 2019 Overview LP background Serial simplex

776 views • 59 slides
Existence of CAT(0) structures for finite type Artin groups B 9 A 9 D 9 B 8 A 8 D 8 E 8 B 7 A 7 D

Existence of CAT(0) structures for finite type Artin groups B 9 A 9 D 9 B 8 A 8 D 8 E 8 B 7 A 7 D

Existence of CAT(0) structures for finite type Artin groups B 9 A 9 D 9 B 8 A 8 D 8 E 8 B 7 A 7 D 7 E 7 B 6 A 6 D 6 E 6 B 5 A 5 D 5 ? F 4 B 4 A 4 D 4 H 4 B 3 A 3 H 3 I 2 ( m ) B 2 A 2 A 1 Jon McCammond U.C. Santa Barbara 1 Overview I.

526 views • 19 slides
Dynamic Programming Modan Dynamic programming? Recursion? What is DP? The

Dynamic Programming Modan Dynamic programming? Recursion? What is DP? The

Dynamic Programming Modan Dynamic programming? Recursion? What is DP? The hardest of the 4 common problem solving paradigms? The easiest of the 4 common problem solving paradigms? Problem DAG Paths Given a directed

934 views • 70 slides
Study of Halo ! " $% Background in the KOTO experiment Yuya Noichi Year End

Study of Halo ! " $% Background in the KOTO experiment Yuya Noichi Year End

Study of Halo ! " $% Background in the KOTO experiment Yuya Noichi Year End Presentation 2019 2019/12/23 2019 Year End Presentation 1 KOTO Experiment Search for ! " $ % &' & decay () undetectable &

402 views • 27 slides
A few announcements CSC630: Advanced topics in interactive data analysis catalog

A few announcements CSC630: Advanced topics in interactive data analysis catalog

A few announcements CSC630: Advanced topics in interactive data analysis catalog advertises as Advanced topics in Software Systems Research seminar all paper readings, discussions, presentations, projects CSC630: Advanced

647 views • 29 slides
Increasing spanning forests Joshua Hallam Wake Forest University Jeremy Martin University of

Increasing spanning forests Joshua Hallam Wake Forest University Jeremy Martin University of

Increasing spanning forests Joshua Hallam Wake Forest University Jeremy Martin University of Kansas Bruce Sagan Michigan State University www.math.msu.edu/sagan April 9, 2016 The factorization theorem Connection with the chromatic

368 views • 9 slides

More recommend