A degree condition for cycles of maximum length in bipartite digraphs.
Janusz AdamusLech AdamusPublished in: Discret. Math. (2012)
Keyphrases
- maximum number
- graph model
- undirected graph
- bipartite graph
- energy dissipation
- sufficient conditions
- real valued
- equivalence classes
- computer vision
- graph partitioning
- directed graph
- minimum distance
- path length
- database
- artificial neural networks
- data structure
- image segmentation
- website
- search engine
- artificial intelligence
- real world
- real time