You are here

Home » Content

Theoretical Analysis of Communication Networks in a Bipartite Setting

Journal Name:

  • Journal of Control Engineering and Technology

Publication Year:

  • 2013

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Many real-world network problems are modeled by digraphs. In this paper, we study orthogonal factorization for bipartite digraph, and show the following result: Let G be a bipartite (0, mf－m+1)-digraph. Let f be an integer-valued function defined on V(G) such that k  f(x), and let H1, …, Hk be an m-subdigraph of G. Then G has a (0, f)-factorization orthogonal to each Hi (1  i  k).
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastrmx_153796_3_pp_61-68.pdf
  • 2
61-68
  • English

REFERENCES

References: 

[1] B. Alspach, K. Heinrich, and G. Liu, Contemporary Design
Theory—A Collection of Surveys, John Wiley and Sons, New
York, pp. 13–37, 1992.
Journal of Control Engineering and Technology (JCET)
JCET Vol. 3 Iss. 2 April 2013 PP. 61-68 www.ijcet.org ○C American V-King Scientific Publishing
68
[2] P. Lam, G. Liu, G. Li, and W. Shiu, “Orthogonal (g, f)-factorizations in networks”, Networks, 35 pp. 274–278, 2000.
[3] S. Agarwal, P. Niyogi, “Stability and generalization of bipartite ranking algorithms,” in proceedings of the 18th Annual Conference on Learning Theory, 2005.
[4] Gao W, Zhang Y, Gao Y, Liang L, and Xia Y, “Strong and Weak Stability of Bipartite Ranking Algorithms”, International Conference on Engineering and Information Management, April, 2011, Chengdu, China, IEEE press, pp. 303-307.
[5] S. Clemencon, N, Vayatis, “On Partitioning Rules for Bipartite Ranking”, in Proceedings of the 12th International Conference on Articial Intelligence and Statistics (AISTATS), 2009, Florida, USA. Vol. 5 JMLR:W&CP 5, pp. 97-104
[6] T. Gallai, “Maximum-minimum Satze and verallgemeinerte Factoren von Graphen”, Acta Math Acad Sci Hungar, 12, pp. 131–173, 1961.
[7] G. Liu, “Orthogonal factorizations of digraphs”, Front. Math. China, vol. 4, no. 2, pp. 311–323, 2009.
[8] C. Wang, “Subdigraphs with orthogonal factorizations of digraphs”, European Journal of Combinatorics, vol. 33, pp. 1015–1021, 2012.
[9] J. Folkman, D.R. Fulkerson, “Flows in infinite graphs”, J. Combin.Theory, vol. 8, pp. 30-44, 1970.
[10] G. Liu, B. Zhu, “Some problems on factorizations with constraints in bipartite graphs”, Discrete Applied Mathematics, vol. 128, pp. 421-434, 2003.
[11] S. Zhou, “Orthogonal factorization of (0, mf−m+1)-digraph”, unpblished.
[12] K. Heinrich, P. Hell, D.G. Kirkpatrick, and G. Liu, “A simple existence criterion for (g, f)-factors”, Discrete Math., 85, pp. 315-317, 1990.
[13] P. Hell, D.G. Kirkpatrick, “Algorithms for degree constrained graph factors of minimum de1ciency”, J. Algorithms, vol. 14, pp.115-138, 1993.
[14] R.P. Anstee, “An algorithmic proof of Tuttes f-factor theorem”, J. Algorithms, vol. 6, pp. 112-131, 1985.

Thank you for copying data from http://www.arastirmax.com