on strict outer confluent graphs
play

On Strict (Outer-)Confluent Graphs Henry F orster, Robert Ganian, - PowerPoint PPT Presentation

Nov 20, 2023 •379 likes •1.86k views

On Strict (Outer-)Confluent Graphs Henry F orster, Robert Ganian, Fabian Klute, Martin N ollenburg Graph Drawing 2019 September 18, 2019 1/21 Confluence Technique to bundle edges 2/21 Henry F orster, Robert Ganian, Fabian Klute,

  1. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal circle-trapezoid circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  2. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal circle-trapezoid circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  3. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal circle-trapezoid ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  4. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  5. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  6. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  7. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle series-parallel strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  8. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  9. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  10. Our Results subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  11. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  12. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  13. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 3 ≤ c ≤ 4 string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  14. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 3 ≤ c ≤ 4 c = 2 string outer-string interval-filament co-comparability strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  15. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 3 ≤ c ≤ 4 c = 2 string outer-string interval-filament co-comparability c = 1 strict-confluent unit interval polygon-circle bounded series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? c = 1 circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  16. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 3 ≤ c ≤ 4 c = 2 string outer-string interval-filament co-comparability c = 1 strict-confluent unit interval polygon-circle bounded c = 2 series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? c = 1 circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  17. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 3 ≤ c ≤ 4 c = 2 string outer-string interval-filament ? co-comparability c = 1 strict-confluent unit interval polygon-circle bounded c = 2 series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? c = 1 circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  18. Our Results Cop number: c [Gavenˇ ciak et al. 18] subtree-filament 3 ≤ c ≤ 15 3 ≤ c ≤ 4 c = 2 string outer-string interval-filament ? co-comparability c = 1 strict-confluent unit interval polygon-circle bounded c = 2 series-parallel cliquewidth strict-outerconfluent pseudo-split chordal tree-like ∆ -strict-outerconfluent ? c = 1 circle-trapezoid distance-hereditary ∆ -confluent circular arc strict bipartite outerconfluent circle bipartite permutation bipartite permutation trapezoid comparability bipartite permutation ∩ domino-free 6/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  19. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  20. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  21. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  22. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  23. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  24. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  25. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  26. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  27. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  28. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  29. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  30. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A path 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  31. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  32. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  33. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  34. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  35. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  36. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  37. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  38. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  39. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  40. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  41. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  42. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  43. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  44. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  45. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  46. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  47. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  48. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  49. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  50. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  51. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  52. Cops and Robbers Simple two player game on a graph Cop player has k cop tokens Robber player has 1 robber token In a turn player can move their token to adjacent vertices Robber is caught if it coincides with a cop Cop-number: What is the smallest k such that cop player wins? Example: A circle 7/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  53. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  54. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  55. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  56. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  57. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  58. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  59. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  60. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  61. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  62. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  63. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  64. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

  65. Cops and Robbers meeting SOC Graphs Result: Strict outer-confluent graphs have cop-number 2 u v r Using one cop, robber is “locked” between u and v How to lock robber to smaller set of vertices? 8/21 Henry F¨ orster, Robert Ganian, Fabian Klute, Martin N¨ ollenburg · On SOC Graphs

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

Maximum Independent Set in 2-Direction Outer-Segment Graphs Holger Flier, Mat Mihalk, Peter

Maximum Independent Set in 2-Direction Outer-Segment Graphs Holger Flier, Mat Mihalk, Peter

Maximum Independent Set in 2-Direction Outer-Segment Graphs Holger Flier, Mat Mihalk, Peter Widmayer, Anna Zych ETH Zrich 1 The problem: Maximum Independent Set of Segments aligned horizontally or vertically inside a disk with one

423 views • 24 slides
Part I: OUTER SPACE SECURITY and An Update on Outer Space Security A BRIEF

Part I: OUTER SPACE SECURITY and An Update on Outer Space Security A BRIEF

23-May-18 AN INTRODUCTION TO Part I: OUTER SPACE SECURITY and An Update on Outer Space Security A BRIEF HISTORY OF THE PREVENTION OF AN ARMS RACE IN OUTER SPACE Two presentations to inform CD Subsidiary Body 3 discussion 23

672 views • 8 slides
The Monad of Strict Computation A Categorical Framework for the Semantics of Languages in which

The Monad of Strict Computation A Categorical Framework for the Semantics of Languages in which

The Monad of Strict Computation A Categorical Framework for the Semantics of Languages in which Strict and Non-strict computation rules are mixed Dick Kieburtz Portland State University WG2.8 Meeting July 16-20, 2007 The Problem, illustrated

507 views • 16 slides
Non-Strict Temporal Exploration Thomas Erlebach and Jakob T. Spooner School of Informatics,

Non-Strict Temporal Exploration Thomas Erlebach and Jakob T. Spooner School of Informatics,

Non-Strict Temporal Exploration Thomas Erlebach and Jakob T. Spooner School of Informatics, University of Leicester (Slides mostly prepared by Jakob) Algorithmic Aspects of Temporal Graphs III (Satellite Workshop of ICALP 2020) July 7, 2020

856 views • 58 slides
Background on Confluent The Primer Discussion Company Overview Platform

Background on Confluent The Primer Discussion Company Overview Platform

A Primer for budding entrepreneurs: I think I have a great idea, now what? Background on Confluent The Primer Discussion Company Overview Platform technology of in situ polymerized biomaterials and delivery devices

912 views • 28 slides
SHOULD STRICT CRIMINAL LIABILITY BE REMOVED FROM ALL IMPRISONABLE OFFENCES? ANDREW ASHW ORTH,

SHOULD STRICT CRIMINAL LIABILITY BE REMOVED FROM ALL IMPRISONABLE OFFENCES? ANDREW ASHW ORTH,

SHOULD STRICT CRIMINAL LIABILITY BE REMOVED FROM ALL IMPRISONABLE OFFENCES? ANDREW ASHW ORTH, THE J.M. K ELLY LECTURE 20 10 What is strict crim inal liability? An offence should be treated as a crime of strict liability if it

309 views • 14 slides
Graphs () Graphs () Graphs Graphs Graphs are collections of nodes

Graphs () Graphs () Graphs Graphs Graphs are collections of nodes

Graphs () Graphs () Graphs Graphs Graphs are collections of nodes in which various pairs are connected by K08 line segments. The

627 views • 17 slides
Graphs Graphs Examples Definitions Implementation/Representation of graphs Graphs

Graphs Graphs Examples Definitions Implementation/Representation of graphs Graphs

CS171 Introduction to Computer Science II Science II Graphs Graphs Examples Definitions Implementation/Representation of graphs Graphs Graphs: set of vertices connected pairwise by edges Interesting and useful structure

346 views • 30 slides
The Power of the Log LSM & Append Only Data Structures Ben Stopford Confluent Inc

The Power of the Log LSM & Append Only Data Structures Ben Stopford Confluent Inc

The Power of the Log LSM & Append Only Data Structures Ben Stopford Confluent Inc @benstopford Kafka: a Streaming Platform Producer Consumer Connectors Connectors The Log Streaming Engine KAFKAs Distributed Log Append Only Linear

1.07k views • 71 slides
Confluent Orthogonal Drawing for Syntax Diagrams S-expression ( S-expression

Confluent Orthogonal Drawing for Syntax Diagrams S-expression ( S-expression

Confluent Orthogonal Drawing for Syntax Diagrams S-expression ( S-expression S-expression ) . AZ AZ 09 Michael J. Bannister David A. Brown David Eppstein Context-Free Grammars LISP 1.5 S-expression: (

486 views • 30 slides
ETL is dead; long-live streams Neha Narkhede, Co-founder & CTO, Confluent Data and

ETL is dead; long-live streams Neha Narkhede, Co-founder & CTO, Confluent Data and

ETL is dead; long-live streams Neha Narkhede, Co-founder & CTO, Confluent Data and data systems have really changed in the past decade Old world: Two popular locations for data DB DB DWH DB DB Operational databases Relational

1.22k views • 103 slides
Overview for NEO United Nations Office of Outer Space Affairs Committee on Peaceful Uses of Outer

Overview for NEO United Nations Office of Outer Space Affairs Committee on Peaceful Uses of Outer

Overview for NEO United Nations Office of Outer Space Affairs Committee on Peaceful Uses of Outer Space Threat Response United Nations COPUOS/OOSA Next meetings planned in conjunction with Inform in case of credible threat DPS/EPSC Oct

216 views • 4 slides
The regional picture: planning for outer London DEMOS/LSE Event 30 June 2011 Why is Outer

The regional picture: planning for outer London DEMOS/LSE Event 30 June 2011 Why is Outer

The regional picture: planning for outer London DEMOS/LSE Event 30 June 2011 Why is Outer London important? Its where 60% of Londoners live Its where 40% of Londons jobs are Its where a substantial chunk of Londons

489 views • 24 slides
Graphs Graphs Simple graphs Algorithms Depth-first search Breadth-first search

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

CS171 Introduction to Computer Science II Graphs Graphs Simple graphs Algorithms Depth-first search Breadth-first search shortest path Connected components Directed graphs Weighted graphs Minimum spanning tree

781 views • 53 slides
On a model of Josephson effect, dynamical systems on two-torus and double confluent Heun equations

On a model of Josephson effect, dynamical systems on two-torus and double confluent Heun equations

On a model of Josephson effect, dynamical systems on two-torus and double confluent Heun equations V.M.Buchstaber, A.A.Glutsyuk, S.I.Tertychnyi International Conference dedicated to G.M. Henkin, Quasilinear equations, inverse problems and their

832 views • 37 slides
Weighted graphs 2 Weighted graphs So far we have only considered weighted graphs with

Weighted graphs 2 Weighted graphs So far we have only considered weighted graphs with

1 Weighted graphs 2 Weighted graphs So far we have only considered weighted graphs with weights > 0 (Dijkstra is a super-star here) Now we will consider graphs with any integer edge weight (i.e. negative too) 3 Cycles Does a

831 views • 43 slides
On the Complexity of k-Piecewise Testability and the Depth of Automata Tom Masopust and

On the Complexity of k-Piecewise Testability and the Depth of Automata Tom Masopust and

On the Complexity of k-Piecewise Testability and the Depth of Automata Tom Masopust and Michal Thomazo TU Dresden, Germany DLT 2015 1 / 24 Problems 2 / 24 Problems Problem (k-PiecewiseTestability) Input: an automaton (min. DFA or NFA)

898 views • 44 slides
Confluence of Shallow Right-Linear Systems Guillem Godoy Ashish Tiwari Technical University of

Confluence of Shallow Right-Linear Systems Guillem Godoy Ashish Tiwari Technical University of

Confluence of Shallow Right-Linear Systems Guillem Godoy Ashish Tiwari Technical University of Catalonia Computer Science Laboratory Jordi Girona 1 SRI International Barcelona, Spain Menlo Park, CA Ashish Tiwari, SR I

591 views • 16 slides
ACPH System Description for CoCo 2017 Kouta Onozawa (Tohoku University) Kentaro Kikuchi (Tohoku

ACPH System Description for CoCo 2017 Kouta Onozawa (Tohoku University) Kentaro Kikuchi (Tohoku

ACPH System Description for CoCo 2017 Kouta Onozawa (Tohoku University) Kentaro Kikuchi (Tohoku University) Takahito Aoto (Niigata University) Yoshihito Toyama (Tohoku University) ACPH Automated Confluence Prover for Higher-order rewriting

298 views • 7 slides
Apache Kafka + Apache Mesos Highly Scalable Streaming Microservices with Kafka Streams Kai

Apache Kafka + Apache Mesos Highly Scalable Streaming Microservices with Kafka Streams Kai

Apache Kafka + Apache Mesos Highly Scalable Streaming Microservices with Kafka Streams Kai Waehner Technology Evangelist kontakt@kai-waehner.de LinkedIn @KaiWaehner www.kai-waehner.de Confidential 1 Abstract Microservices establish many

977 views • 44 slides
polynomial time B polynomial time Stephen Bellantoni and Stephen Cook A new Recursion-Theoretic

polynomial time B polynomial time Stephen Bellantoni and Stephen Cook A new Recursion-Theoretic

Exponential Path Order EPO Martin Avanzini 1 Naohi Eguchi 2 Georg Moser 1 1 Computational Logic Faculty of Computer Science, University of Innsbruck, Austria 2 School of Information Science Japan Advanced Institute of Science and Technology,

822 views • 54 slides
Classical logic, control calculi and data types Robbert Krebbers November 2, 2010 @ The Brouwer

Classical logic, control calculi and data types Robbert Krebbers November 2, 2010 @ The Brouwer

Classical logic, control calculi and data types Robbert Krebbers November 2, 2010 @ The Brouwer seminar The Curry-Howard correspondence Computation Logic Types Formulas Programs Proofs Reduction Proof

572 views • 33 slides
Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering FroCoS 2013

Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering FroCoS 2013

Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering FroCoS 2013 Takahito Aoto (Tohoku University) Outline 1. Backgrounds: TRS and Confluence 2. Backgrounds: Proving (Non)-Confluence 3. Proving Non-Joinability by

684 views • 40 slides
SGGS: A CDCL-like first-order theorem-proving method 1 Maria Paola Bonacina Dipartimento di

SGGS: A CDCL-like first-order theorem-proving method 1 Maria Paola Bonacina Dipartimento di

Outline Big picture Motivation SGGS: Semantically-Guided Goal Sensitive reasoning Discussion SGGS: A CDCL-like first-order theorem-proving method 1 Maria Paola Bonacina Dipartimento di Informatica Universit` a degli Studi di Verona Verona,

815 views • 62 slides

More recommend