Filters
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
We study exact solutions for the parameterized independent set problem on disk graphs. The method is based on geometric separation on the underlying graph representation......
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
The paper provides an subexponential algorithm for the parameterized independence problem on unit disk graphs.
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Exponential number of stationary solutions for Nagumo equations on graphs
We study the Nagumo reaction–diffusion equation on graphs and its dependence on the underlying graph structure and reaction–diffusion parameters. We provide necessary stationary solutions. Furthermore, we observe that for s...
Pure mathematics
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Improving Solutions of Problems of Motion on Graphs by Redundancy Elimination
Problems of motion on graphs are addressed in this paper. Specifically, the quality (length) of solutions of these problems is adressed. The quality of solutions is improved by redundancy elimination....
JD - Využití počítačů, robotika a její aplikace
- 2010 •
- O
Rok uplatnění
O - Ostatní výsledky
Solving circuits by signal flow graphs - Animation
Animations are a supplement the textbook: solution circuits using signal flow graphs. Animations were created for students in order to facilitate understanding circuits using directed graphs of signal flow. They are describ...
JA - Elektronika a optoelektronika, elektrotechnika
- 2016 •
- A
Rok uplatnění
A - Audiovizuální tvorba
Visualization as a tool for acquiring knowledge about the quality of solutions of prob-lems of motion on graphs
The quality (length) of solutions of problems of motion on graphs is addressed in this paper. Existing state-of-the-art algorithms for generating solutions of these problems are suspected of producing solutions con...
JD - Využití počítačů, robotika a její aplikace
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Two-factorizations of small complete graphs II: The case of 13 vertices
We establish that for each of the 5005 possible types of 2-factorizations of the complete graph K13, there exists at least one solution. We also enumerate all nonisomorphic solutions to the Oberwolfach problem OP(13;3,3,3,4...
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Visualization of selected graph algorithms
to the project FRVŠ 2646/2012 E-learning support for the solution of selected graph problems. Theprogram offers effective, vivid and faultless visualization / automatical solution of graph tasks. It can be used in...
BB - Aplikovaná statistika, operační výzkum
- 2012 •
- R •
- Link
Rok uplatnění
R - Software
Výsledek na webu
Comparison of the Methods of Graphical Solution of Symbolic Sensitivity
Signal-flow graph (SFG) technique is a very useful tool for a hand analysis, the SFG's have been effectively used for the sensitivity solutions, too. This paper describes the comparison between two graph methods for de...
Electrical and electronic engineering
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Steiner Tree problem on various classes of directed sparse graphs. While in the solution tree. All that is known for this parameterization is that both the directed and the undirected versions are W[2]-hard on general graphs
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 81 505