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

20 502 (0,111s) •

Result

Largest Planar Matching in Random Bipartite Graphs

Largest Planar Matching in Random Bipartite Graphs...

BA - Obecná matematika

  • 2002
    • •
  • Jx
Result

Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs (article no. R135)

Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.

BA - Obecná matematika

  • 2008
    • •
  • Jx
Result

Localization in random bipartite graphs: numerical and empirical study

We investigate adjacency matrices of bipartite graphs with a power-law degree distribution. We establish the position of the mobility edge....

Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect)

  • 2017
    • •
  • Jimp
    • •
  • Link
Result

A Class of Random Fields on Complete Graphs with Tractable Partition Function

for random fields on complete bipartite graphs, provided they have homogeneous pairwise potentials. We expect that these tractable classes of large scale random fields can the partition function and marginal proba...

JD - Využití počítačů, robotika a její aplikace

  • 2013
    • •
  • Jx
    • •
  • Link
Result

Non-Bipartite K-Common Graphs

A graph H is k-common if the number of monochromatic copies of H in a k-edge-coloring of Kn is asymptotically minimized by a random coloring. For every k, we construct a connected non-bipartite k-common graph. This...

Pure mathematics

  • 2022
    • •
  • Jimp
    • •
  • Link
Result

Matching graphs of hypercubes and complete bipartite graphs

We proved that the matching graph of a complete bipartite graph Knn is connected and bipartite if and only if n is even....

BA - Obecná matematika

  • 2009
    • •
  • Jx
Result

Identifying and locating-dominating codes in (random) geometric networks

and locating-dominating codes in unit disk graphs. It is known that minimizing the size of an identifying code is NP-complete even for bipartite graphs. First, we improve this result by showing that the problem remains NP-...

BA - Obecná matematika

  • 2009
    • •
  • Jx
Result

On the b-chromatic number of graphs

We study a variant of graph coloring which requires that every color class contains a vertex which sees all other colors. We prove hardness results in of bipartite graphs, bounds for planar graphs and we study the ...

BA - Obecná matematika

  • 2002
    • •
  • D
Result

Unsupervised (parameter) learning for MRFs on bipartite graphs

We consider unsupervised (parameter) learning for general Markov random fields on bipartite graphs. This model class includes Restricted Boltzmann Machines. We show that besides the widely used stochastic gradient approxima...

JD - Využití počítačů, robotika a její aplikace

  • 2013
    • •
  • D
    • •
  • Link
Result

On bipartite graphs of defect 2

It is known that the Moore bipartite bound provides an upper bound on the order of a connected bipartite graph. In this paper we deal with bipartite graphs of maximum degree at least 2, diameter at least 2...

BA - Obecná matematika

  • 2009
    • •
  • Jx
  • 1 - 10 out of 20 502