All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

14 543 (0,135s) •

Result

On Colourability of Polygon Visibility Graphs

We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove that the 5-colourability questi...

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

  • 2024
    • •
  • Jimp
    • •
  • Link
Result

On Colourability of Polygon Visibility Graphs

We study the problem of colouring the visibility graphs of polygons. In particular, we provide a polynomial algorithm for 4-colouring of the polygon visibility graphs, and prove that the 6-colourability question is...

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

  • 2018
    • •
  • D
    • •
  • Link
Result

Unit Disk Visibility Graphs

We study unit disk visibility graphs, where the visibility relation between between them. This particular graph class models real world scenarios more accurately compared to the conventional visibility

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

  • 2021
    • •
  • D
    • •
  • Link
Result

On colouring point visibility graphs

In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring of deciding whether the visibility graph of a point s...

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

  • 2020
    • •
  • Jimp
    • •
  • Link
Result

3D Visibility Representations of Complete Graphs

This paper continues the study of 3D visibility representations of complete graphs where vertices are represented by equal convex polygons lying in planes parallel to the $xy$-plane. Edges correspond to the $z$-parallel visibili...

BA - Obecná matematika

  • 2004
    • •
  • Jx
Result

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

The visibility graph $V(P)$ of a set of points $P$ in the plane is the graph with vertex set $P$ where two vertices $u$ and $v$ are adjacent if and only if there is no point from $P$ on the segment connecting $u$ with $v$. ...

BA - Obecná matematika

  • 2005
    • •
  • Jx
Result

On the Connectivity of Visibility Graphs

The visibility graph of a finite set of points in the plane has the points of visibility graphs. Unless all its vertices are collinear, a visibility graph has diameter visibility grap...

BA - Obecná matematika

  • 2012
    • •
  • Jx
    • •
  • Link
Result

Incidence semirings of graphs and visible bases

We consider the incidence semirings of graphs and prove that every incidence semiring has visible bases for its right ideals and for its left ideals, and that these visible bases can be used to determine the weights of all ...

BA - Obecná matematika

  • 2014
    • •
  • Jx
    • •
  • Link
Result

SOMA Network Model Based on Native Visibility Graph

In this article, we want to propose a new model of the network for analyzing the evolution algorithms. We focus on the graph called native visibility graph. We show how we can get a time series from the run of the self-orga...

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

  • 2017
    • •
  • Jost
Result

FO model checking of geometric graphs

of graphs or other structures. We study the FO model checking problem for dense graph classes definable by geometric means (intersection and visibility graphs). We obtain, circle, box, disk, and polygon-visibi...

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

  • 2018
    • •
  • D
    • •
  • Link
  • 1 - 10 out of 14 543