Pebble games over ordered structural abstractions

Yuguo He*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce a new notion called structural abstractions, which is particularly suitable for pebble games over finite ordered graphs. In an example, we show how to apply structural expansions and abstrac-tions in constructions and how to play pebble games over ordered struc-tural abstractions. The proof includes several observations and insights that are fundamental for any games over structural abstractions, which can be used to obtain lower bounds for a number of graph problems with order.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings
EditorsGerhard Jager, Silvia Steila, T.V. Gopal
PublisherSpringer Verlag
Pages319-332
Number of pages14
ISBN (Print)9783319559100
DOIs
Publication statusPublished - 2017
Event14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 - Bern, Switzerland
Duration: 20 Apr 201722 Apr 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10185 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017
Country/TerritorySwitzerland
CityBern
Period20/04/1722/04/17

Keywords

  • Finite model theory
  • Pebble games
  • Structural abstraction

Cite this