bipartite graph

(redirected from Bigraph)

bipartite graph

[bī′pär‚tīt ′graf]
(mathematics)
A linear graph (network) in which the nodes can be partitioned into two groups G1 and G2 such that for every arc (i,j) node i is in G1 and node j in G2.

bipartite graph

References in periodicals archive ?
Actually, finding bipartitioning of bigraph can be understood as classifying each point into two classes, for example, +1 and -1.
SPHier [7] extract clusters from dataset using bipartite crossing minimization biclustering techniques but instead of serial Bigraph crossing minimization using parallel algorithm in order to increase the performance of the algorithm beside the enhancement made on Cheng and Church biclustering algorithm to enable the local search for clusters instead of global search because after the Bigraph reordering the related values arranged together in blocks and global search is useless.
The bigraph associated with M is the undirected bipartite graph on vertices V = X [union] Y that has [x.
2001) Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization.
3] The bigraph ex when it appears initially may be written + instead of c+, as in extremely [+trimli], exit [+;t], x-ray [+-re], and EXTRA [$TRA].
If a bigraph is connected and has at least three vertices, then clearly its kth power (for k [greater than or equal to] 2) has a cycle of length three.
Wang, "An algorithm for constructing the maximum matching graphs on bigraphs," Acta Electronica Sinica, vol 38, no.
Phonologic treatment for deep dyslexia using bigraphs instead of graphemes.
Material is arranged in four chapters covering basic concepts of bimatrices, bigraphs and their application to bimatrices, application of bimatrices to new fuzzy models, and neutrosophic bigraphs--their generalizations and applications to neutrosophic models.
HUANG, Certifying Lex BFS recognition algorithms for proper interval graphs and proper interval bigraphs, SIAM Journal on Discrete Mathematics, 18 (2005), pp.
The classes of bounded bipartite tolerance graphs ((iii)), bipartite permutation graphs, unit interval bigraphs, and asteroidal-triple-free (AT-free) bipartite graphs are all equivalent, see Hell and Huang [16], and Golumbic and Trenk [14] for details about these classes of graphs and their equivalence.