Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Alekseev, Vladimir E."'
How to efficiently represent a graph in computer memory is a fundamental data structuring question. In the present paper, we address this question from a combinatorial point of view. A representation of an $n$-vertex graph $G$ is called implicit if i
Externí odkaz:
http://arxiv.org/abs/2303.04453
Publikováno v:
DMTCS Volume 6 n. 2 (2004), pp. 215-222 http://dmtcs.loria.fr/volumes/abstracts/dm060204.abs.html
For graph classes $P_1,...,P_k$, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph $G$ can be partitioned into subsets $V_1,...,V_k$ so that $V_j$ induces a graph in the class $P_j$ $(j=1,2,...,k)$. If $P_1
Externí odkaz:
http://arxiv.org/abs/math/0306178
Publikováno v:
In Discrete Mathematics 2004 285(1):1-6
Autor:
Alekseev, Vladimir E.1 ave@uic.nnov.ru, Farrugia, Alastair2 afarrugia@alumni.math.uwaterloo.ca, Lozin, Vadim V.3 lozin@rutcor.rutgers.edu
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). Dec2004, Vol. 7 Issue 2, p215-221. 7p.
Autor:
Alekseev, Vladimir E., Lozin, Vadim V., Malyshev, Dimitry, Milanič, Martin, Ochmański, Edward
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540852377
MFCS
MFCS
We study the computational complexity of finding a maximum independent set of vertices in a planar graph. In general, this problem is known to be NP-hard. However, under certain restrictions it becomes polynomial-time solvable. We identify a graph pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94e9ec98c83341d4a9a27417d9d153f2
https://pub.uni-bielefeld.de/record/2427252
https://pub.uni-bielefeld.de/record/2427252
Autor:
Alekseev, Vladimir E., Lozin, Vadim V.
Publikováno v:
In Discrete Mathematics 2003 265(1):351-356
Autor:
Alekseev, Vladimir E.1 ave@uic.nnov.ru, Lozin, Vadim V.2 lozin@rutcor.rutgers.edu
Publikováno v:
Discrete Applied Mathematics. Dec2004, Vol. 145 Issue 1, p3-10. 8p.
Autor:
Alekseev, Vladimir E.1 ave@uic.nnov.ru
Publikováno v:
Discrete Applied Mathematics. Oct2003, Vol. 132 Issue 1-3, p17. 10p.