Výsledky vyhledávání - "computational complexity of graph problems"

  • Zobrazuji výsledky 1 - 7 z 7
Upřesnit hledání
  1. 1
    Obálka

    Special Issue on “Graph Algorithms and Applications” Autor Cicerone, Serafino, Di Stefano, Gabriele

    ISSN: 1999-4893, 1999-4893
    Vydáno: Basel MDPI AG 01.05.2021
    Vydáno v Algorithms (01.05.2021)
    “…The mixture of data in real life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image…”
    Získat plný text
    Journal Article
    Přidat do oblíbených
    Uloženo v:
  2. 2
    Obálka

    Graph Algorithms and Applications

    ISBN: 9783036515410, 3036515410, 3036515429, 9783036515427
    Vydáno: Basel MDPI - Multidisciplinary Digital Publishing Institute 2022
    “…The mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image…”
    Získat plný text
    E-kniha
    Přidat do oblíbených
    Uloženo v:
  3. 3
    Obálka

    A survey on alliances and related parameters in graphs Autor Fernau, Henning, Rodrıguez-Velazquez, Juan A.

    ISSN: 2338-2287, 2338-2287
    Vydáno: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 01.01.2014
    “…In this paper, we show that several graph parameters are known in different areas under completely different names. More specifically, our observations connect…”
    Získat plný text
    Journal Article
    Přidat do oblíbených
    Uloženo v:
  4. 4
    Obálka

    On a Countable Family of Boundary Graph Classes for the Dominating Set Problem Autor Dakhno, G. S., Malyshev, D. S.

    ISSN: 1990-4789, 1990-4797
    Vydáno: Moscow Pleiades Publishing 01.03.2023
    “… If this set is finite, then the class is said to be finitely defined. The concept of a boundary class is a useful tool for the analysis of the computational complexity of graph problems in the family of finitely defined classes…”
    Získat plný text
    Journal Article
    Přidat do oblíbených
    Uloženo v:
  5. 5
    Obálka

    Critical elements in combinatorially closed families of graph classes Autor Malyshev, D. S.

    ISSN: 1990-4789, 1990-4797
    Vydáno: Moscow Pleiades Publishing 01.01.2017
    “…The notions of boundary and minimal hard classes of graphs, united by the term “critical classes,” are useful tools for analysis of computational complexity of graph problems in the family of hereditary graph classes…”
    Získat plný text
    Journal Article
    Přidat do oblíbených
    Uloženo v:
  6. 6
    Obálka

    A complexity dichotomy and a new boundary class for the dominating set problem Autor Malyshev, D. S.

    ISSN: 1382-6905, 1573-2886
    Vydáno: New York Springer US 01.07.2016
    Vydáno v Journal of combinatorial optimization (01.07.2016)
    “…We study the computational complexity of the dominating set problem for hereditary graph classes, i.e., classes of simple unlabeled graphs closed under…”
    Získat plný text
    Journal Article
    Přidat do oblíbených
    Uloženo v:
  7. 7
    Obálka

    Graph Homomorphism, Monotone Classes and Bounded Pathwidth Autor Eagling-Vose, Tala, Barnaby, Martin, Paulusma, Daniel, Siggers, Mark, Smith, Siani

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 01.03.2024
    Vydáno v arXiv.org (01.03.2024)
    “…A recent paper describes a framework for studying the computational complexity of graph problems on monotone classes, that is those omitting a set of graphs as a subgraph…”
    Získat plný text
    Paper
    Přidat do oblíbených
    Uloženo v:

Vyhledávací nástroje: