Graph Homomorphisms

Result code in IS VaVaI

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

Result on the web

<a href="https://www.cambridge.org/cz/academic/subjects/mathematics/discrete-mathematics-information-theory-and-coding/topics-algorithmic-graph-theory?format=HB" target="_blank" >https://www.cambridge.org/cz/academic/subjects/mathematics/discrete-mathematics-information-theory-and-coding/topics-algorithmic-graph-theory?format=HB</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Graph Homomorphisms

Original language description

Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. This chapter provides an overview of algorithmic aspects of graph homomorphisms.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

—

OECD FORD branch

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

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2021

Confidentiality

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

Book/collection name

Topics in Algorithmic Graph Theory

ISBN

978-1-108-49260-7

Number of pages of the result

32

Pages from-to

262-293

Number of pages of the book

364

Publisher name

Cambridge University Press

Place of publication

Neuveden

UT code for WoS chapter

—