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

106 431 (0,202s) •

Result

Oriented Graphs as a Systems Integration Tool

graphs for internal representation of objects and their mutual relationships. In both cases the representing graphs are tools for models integration - in case of data models the classes of graph nodes and...

JC - Počítačový hardware a software

  • 2001
    • •
  • D
Result

Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs

The paper studies nowhere-zero flows on two fundamental classes of signed graphs- signed complete graphs and signed complete bipartite graphs. It proves that the flow number is at most 4 in both cases and character...

BA - Obecná matematika

  • 2015
    • •
  • Jx
    • •
  • Link
Result

Graph Isomorphism for (H-1, H-2)-Free Graphs: An Almost Complete Dichotomy

was finite, but without specifying the open cases. Grohe and Schweitzer proved that Graph of open cases for boundedness of clique-width for (H-1, H-2)-free graphs to five.We resolve the computational complexity of...

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

  • 2021
    • •
  • Jimp
    • •
  • Link
Result

Special Issue on HOMOMORPHISMS AND LIMITS: Preface

Is there a notion of limit for growing graph sequences? What kind of object is this limit? Which graph parameters behave "continuously" when passing to the limit? Limits of graph sequences can be defined in more than one se...

BA - Obecná matematika

  • 2011
    • •
  • O
    • •
  • Link
Result

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

be completed to a representation of the whole graph. We show that in each of the cases above, this problem becomes NP-hard. These are the first classes of geometric graphsPlanar graphs are known to have geometric ...

IN - Informatika

  • 2014
    • •
  • D
    • •
  • Link
Result

On seed graphs with more than two components

. In the general case it is shown how the structure of any component Fi of a seed graph FThe closed neighbourhood NG[x] of a vertex x in a graph G is the subgraph of G induced by all vertices of GNG[x] and we denote it by S...

BA - Obecná matematika

  • 2001
    • •
  • Jx
Result

Graph balancing: A special case of scheduling unrelated parallel machines

We design a 1.75-approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case where each job can be assigned to at most two machines, which the same processing time on either m...

BA - Obecná matematika

  • 2008
    • •
  • D
Result

Logspace reduction of directed reachability for bounded genus graphs to the planar case

We show that reachability in directed graphs embedded on a fixed surface of arbitrary genus is logspace-reducible to reachability in directed graphs embedded in the plane....

IN - Informatika

  • 2010
    • •
  • Jx
Result

The Density Formula : One Lemma to Bound Them All

face graphs. In some cases (1-bend and 2-bend RAC-graphs and fan-crossing/fan of the respective graph classes. In other cases, we give new streamlined and significantly cases (simple and non-homo...

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

  • 2024
    • •
  • D
    • •
  • Link
Result

Solving circuits by multiple transformation graphs

This paper deals with solving electronics circuits by method of the transformation graphs. As described, the Masońs formula for calculation of the result can be left out in selected cases, and the theory of the transformation gr...

Electrical and electronic engineering

  • 2010
    • •
  • D
  • 1 - 10 out of 106 431