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

The computational complexity of graph problems with succinct multigraph representation

Autoři: Marek Karpinski Klaus W. Wagner

Zdroj: Zeitschrift für Operations Research. 32:201-211

Témata: Graph theory, graph algorithms, Analysis of algorithms and problem complexity, matching, 0202 electrical engineering, electronic engineering, information engineering, succinct presentation, 0102 computer and information sciences, 02 engineering and technology, complexity, 01 natural sciences, vertex multiplicity graphs

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1007/BF01928922
https://link.springer.com/content/pdf/10.1007%2FBF01928922.pdf

Special Issue on “Graph Algorithms and Applications”

Autoři: Serafino Cicerone Gabriele Di Stefano

Zdroj: Algorithms, Vol 14, Iss 150, p 150 (2021)

Témata: analysis and design or graph algorithms, distributed graph and network algorithms, graph theory with algorithmic applications, computational complexity of graph problems, experimental evaluation of graph algorithms, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/1999-4893/14/5/150; https://doaj.org/toc/1999-4893; https://doaj.org/article/4b116b8d92db4f22b7b76919fae0267b

Dostupnost: https://doi.org/10.3390/a14050150
https://doaj.org/article/4b116b8d92db4f22b7b76919fae0267b

A survey on alliances and related parameters in graphs

Autoři: Henning Fernau Juan A. Rodríguez-Velázquez

Zdroj: Electronic Journal of Graph Theory and Applications, Vol 2, Iss 1, Pp 70-86 (2014)

Témata: 2. Zero hunger, domination in graphs, graph parameters, alliances in graphs, QA1-939, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, computational complexity of graph problems, Mathematics

Přístupová URL adresa: http://ejgta.org/index.php/ejgta/article/download/55/19
https://doaj.org/article/7616f378920b4e85b528f836f890136d
http://ejgta.org/index.php/ejgta/article/view/55
https://dblp.uni-trier.de/db/journals/ejgta/ejgta2.html#FernauR14
https://www.neliti.com/id/publications/55550/a-survey-on-alliances-and-related-parameters-in-graphs
https://www.ejgta.org/index.php/ejgta/article/view/55

The computational complexity of graph problems with succinct multigraph representation.

Autoři: Karpinski, M. Wagner, K.

Zdroj: ZOR: Mathematical Methods of Operations Research; May1988, Vol. 32 Issue 3/4, p201-211, 11p

A Survey on Alliances and Related Parameters in Graphs

Autoři: Fernau, H. (Henning) Rodriguez-Velazquez, J. A. (Juan)

Zdroj: Electronic Journal of Graph Theory and Applications

Témata: Indonesia, computational complexity of graph problems, alliances in graphs, domination in graphs, graph parameters

Popis souboru: application/pdf

Dostupnost: https://www.neliti.com/publications/55550/a-survey-on-alliances-and-related-parameters-in-graphs

On a Countable Family of Boundary Graph Classes for the Dominating Set Problem.

Autoři: Dakhno, G. S. Malyshev, D. S.

Zdroj: Journal of Applied & Industrial Mathematics; Mar2023, Vol. 17 Issue 1, p25-31, 7p

Graph Homomorphism, Monotone Classes and Bounded Pathwidth

Autoři: Eagling-Vose, Tala Martin, Barnaby Paulusma, Daniel a další

Témata: Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, text

URL: http://arxiv.org/abs/2403.00497

Critical elements in combinatorially closed families of graph classes.

Autoři: Malyshev, D.

Zdroj: Journal of Applied & Industrial Mathematics; Jan2017, Vol. 11 Issue 1, p99-106, 8p

A complexity dichotomy and a new boundary class for the dominating set problem.

Autoři: Malyshev, D.

Zdroj: Journal of Combinatorial Optimization; Jul2016, Vol. 32 Issue 1, p226-243, 18p

Complexity Framework for Forbidden Subgraphs I: The Framework.

Autoři: Johnson, Matthew Martin, Barnaby Oostveen, Jelle J. a další

Zdroj: Algorithmica; Mar2025, Vol. 87 Issue 3, p429-464, 36p

Témata: SUBGRAPHS, CLAWS, HARDNESS, MATHEMATICS, ALGORITHMS

Finding Matching Cuts in H-Free Graphs.

Autoři: Lucke, Felicia Paulusma, Daniël Ries, Bernard

Zdroj: Algorithmica; Oct2023, Vol. 85 Issue 10, p3290-3322, 33p

Témata: NP-complete problems, COMPUTATIONAL complexity, GRAPH algorithms, BOUQUETS

Critical elements in combinatorially closed families of graph classes

Autoři: Dmitriy S. Malyshev

Zdroj: Journal of Applied and Industrial Mathematics. 11:99-106

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/article/10.1134/S1990478917010112
https://link.springer.com/10.1134/S1990478917010112
https://publications.hse.ru/articles/201808086
https://publications.hse.ru/mirror/pubs/share/folder/82j782snzm/direct/201808023

A complexity dichotomy and a new boundary class for the dominating set problem

Autoři: Dmitriy S. Malyshev

Zdroj: Journal of Combinatorial Optimization. 32:226-243

Témata: 13. Climate action, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jco/jco32.html#Malyshev16a
https://link.springer.com/article/10.1007/s10878-015-9872-z
https://link.springer.com/10.1007/s10878-015-9872-z
https://link.springer.com/article/10.1007/s10878-015-9872-z/fulltext.html
https://doi.org/10.1007/s10878-015-9872-z
https://publications.hse.ru/articles/147671596

Critical hereditary graph classes: a survey.

Autoři: Malyshev, D. Pardalos, P.

Zdroj: Optimization Letters; Dec2016, Vol. 10 Issue 8, p1593-1612, 20p

ОТНОСИТЕЛЬНЫЕ ГРАНИЧНЫЕ КЛАССЫ И ФАКТОРИЗАЦИЯ СЕМЕЙСТВА НАСЛЕДСТВЕННЫХ КЛАССОВ ГРАФОВ

Autoři: Малышев, Дмитрий

Témata: НАСЛЕДСТВЕННЫЙ КЛАСС,ОТНОСИТЕЛЬНЫЙ ГРАНИЧНЫЙ КЛАСС,ФАКТОРИЗАЦИЯ

Popis souboru: text/html

Dostupnost: http://cyberleninka.ru/article/n/otnositelnye-granichnye-klassy-i-faktorizatsiya-semeystva-nasledstvennyh-klassov-grafov
http://cyberleninka.ru/article_covers/14583080.png

О СВЯЗИ ПОНЯТИЙ ГРАНИЧНОГО И МИНИМАЛЬНОГО СЛОЖНОГО КЛАССОВ ГРАФОВ

Autoři: Малышев, Дмитрий

Témata: НАСЛЕДСТВЕННЫЙ КЛАСС,ГРАНИЧНЫЙ КЛАСС,МИНИМАЛЬНЫЙ СЛОЖНЫЙ КЛАСС,ЗАДАЧА О СПИСКОВОМ РАНЖИРОВАНИИ,HEREDITARY CLASS,BOUNDARY CLASS,MINIMAL HARD CLASS,LIST-RANKING PROBLEM

Popis souboru: text/html

Dostupnost: http://cyberleninka.ru/article/n/o-svyazi-ponyatiy-granichnogo-i-minimalnogo-slozhnogo-klassov-grafov
http://cyberleninka.ru/article_covers/14593776.png

ГРАНИЧНЫЕ КЛАССЫ ДЛЯ ЗАДАЧ НА ГРАФАХ

Autoři: Малышев, Д.

Témata: ВЫЧИСЛИТЕЛЬНАЯ СЛОЖНОСТЬ,ГРАНИЧНЫЙ КЛАСС

Popis souboru: text/html

Dostupnost: http://cyberleninka.ru/article/n/granichnye-klassy-dlya-zadach-na-grafah
http://cyberleninka.ru/article_covers/14531606.png

The coloring problem for classes with two small obstructions.

Autoři: Malyshev, D.

Zdroj: Optimization Letters; Dec2014, Vol. 8 Issue 8, p2261-2270, 10p

Special Issue on "Graph Algorithms and Applications".

Autoři: Cicerone, Serafino Di Stefano, Gabriele

Zdroj: Algorithms; May2021, Vol. 14 Issue 5, p150, 1p

Témata: GRAPH algorithms, PROBLEM solving, NP-hard problems, COMPUTER engineering, SPECTRUM allocation

Относительные граничные классы и факторизация семейства наследственных классов графов

Zdroj: Вестник Нижегородского университета им. Н.И. Лобачевского.

Témata: НАСЛЕДСТВЕННЫЙ КЛАСС,ОТНОСИТЕЛЬНЫЙ ГРАНИЧНЫЙ КЛАСС,ФАКТОРИЗАЦИЯ, 0101 mathematics, 01 natural sciences

Popis souboru: text/html

Přístupová URL adresa: http://cyberleninka.ru/article/n/otnositelnye-granichnye-klassy-i-faktorizatsiya-semeystva-nasledstvennyh-klassov-grafov
http://cyberleninka.ru/article_covers/14583080.png