| 41. | In this problem, we are given a bipartite graph with an order on the vertices, and an edge.
|
| 42. | Zemor considered a typical class of Sipser Spielman construction of expander codes, where the underlying graph is bipartite graph.
|
| 43. | The time for the algorithm is bounded by the time to edge color a bipartite graph, using the algorithm of.
|
| 44. | It means that the list chromatic index of the complete bipartite graph K _ { n, n } equals n.
|
| 45. | A 3-critical graph is a graph that is not bipartite, but removing any edge produces a bipartite graph?
|
| 46. | Won't the automorphism group of the complete bipartite graph K m, n be S m x S n.
|
| 47. | Therefore, the collaboration graph of film actors can be constructed using a transformation matrix of the bipartite graph interaction matrix.
|
| 48. | Since G \, is a bipartite graph, we may consider its n \ times m \, adjacency matrix.
|
| 49. | Mivar networks can be represented in the form of a bipartite graph consisting of objects-variables and rules-procedures.
|
| 50. | Formalized representation of logical-and-computational data processing method is analogous to the bipartite graph of mivar logical network.
|
