Filtry
The Graph Isomorphism Problem
usable graph isomorphism algorithms is the main issue of the graph isomorphism problem. In this paper, we show several graph isomorphism algorithms and, at the endThe graph isomorphism problem is...
JC - Počítačový hardware a software
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Graph Subcolorings: Complexity and Algorithms
The NP-hardnes of the subchromatic number problem is proved and algorithms are determined for varous classes of graphs.
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Object teaching of Graph algorithms
The base concepts and theorems of the Graph Theory and related Graph Algorithms understanding of graph algorithms develops logical thinking of students very much. Therefore we focus prorely on these proble...
AM - Pedagogika a školství
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
On H-Topological Intersection Graphs
, we give a polynomial-time algorithm for recognizing T-graphs and an O(n(4))-time algorithm for recognizing K-1,K-d-graphs. For the dominating set problem (parameterized by the size of H), we give FPT- and XP-time...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Improvement of shortest path algorithms through graph partitioning
problem of finding of optimal paths in road networks. This paper presents an algorithm based upon traditional graph algorithms, like the Dijkstra's shortest path algorithm butit takes advantage of the specific pro...
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
We present a practical polynomial-time algorithm for computing cyclic edge-connectivity of cubic graphs.
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Exact algorithms for L(2,1)-labeling of graphs
We present an exact exponential time branching algorithm for L(2,1)-labeling of graphs of fixed span.
BD - Teorie informace
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Transport Net Design by Graph Theory Algorithm Modification
There is very often problem with graph theory instrument used in transport application - capacity overrun in several sections. There is why paper author modified the most widespread algorithm to the shortest ways in graph f...
AP - Městské, oblastní a dopravní plánování
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
On H-topological intersection graphs
-graphs and an O(n4)-time algorithm for recognizing K1,d-graphs. For the dominating - and Open image in new window -time algorithms on K1,d-graphs and H-graphs, respectively. Our dominating set
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Puzzles As Excellent Tool Supporting Graph Problems Understanding
of the explained concept or algorithm and suitable graph-representation of a problem material supporting understanding of graph algorithms. On a case study we introduceThe main aim of the subjects dealing with
AM - Pedagogika a školství
- 2014 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 z 37 595