Abstract
In 1983, Greenberg [1] advanced an open problem “We do not have simple criterion that will enable us to characterize which elements of PFFM are quasi-Morishima and which are not.” In this paper, two algorithms of time complexity O(e) are provided.The algorithms can be used to decide which PFFM is quasi-Morishima and which is not. Here e denotes the number of edges of the researched graph. So we give an answer for the open problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Greenberg, H., Richard, J., Maybee, J.:Rectangular matrices and signed graphs, SIAM. J. ALG. DISC. Meth. 4(1983)50–61
Gondran, M.. Graphs and algorithms. John Wiley and Sons. (1979) New York
Harary, F., Normar, R., Cartwright, D.:Structrual Models:An Introduction to the theory of Directed graphs. John Wiley and Sons (1965). New York
Harary.F.:On the notion of balance of a signed graph. Michingan Math. J. 2(1953–54)143–146
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., You, Zy. (1995). PFFM and Quasi-Morishima matrices. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030857
Download citation
DOI: https://doi.org/10.1007/BFb0030857
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive