All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10438400" target="_blank" >RIV/00216208:11320/21:10438400 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=20H12foL0" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=20H12foL0</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00453-020-00745-z" target="_blank" >10.1007/s00453-020-00745-z</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

  • Original language description

    Let C and D be hereditary graph classes. Consider the following problem: given a graph GELEMENT OF D, find a largest, in terms of the number of vertices, induced subgraph of G that belongs to C. We prove that it can be solved in 2 o(n) time, where n is the number of vertices of G, if the following conditions are satisfied:the graphs in C are sparse, i.e., they have linearly many edges in terms of the number of vertices;the graphs in D admit balanced separators of size governed by their density, e.g., O(Δ) or O(m), where Δ and m denote the maximum degree and the number of edges, respectively; andthe considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph. This leads, for example, to the following corollaries for specific classes C and D:a largest induced forest in a Pt-free graph can be found in 2O~(n2/3) time, for every fixed t; anda largest induced planar graph in a string graph can be found in 2O~(n2/3) time.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Algorithmica

  • ISSN

    0178-4617

  • e-ISSN

  • Volume of the periodical

    83

  • Issue of the periodical within the volume

    srpen

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    17

  • Pages from-to

    2634-2650

  • UT code for WoS article

    000554348200001

  • EID of the result in the Scopus database

    2-s2.0-85088961027