DocumentCode :
358359
Title :
Fuzzy marriage problem
Author :
Nair, P.S.
Author_Institution :
Dept. of Comput. Sci., Creighton Univ., Omaha, NE, USA
fYear :
2000
fDate :
2000
Firstpage :
416
Lastpage :
419
Abstract :
The marriage problem poses the following question: if there is a finite set of girls, each of whom knows several boys, under what conditions can all girls marry the boys in such a way that each girl marries a boy she knows? In order to solve this problem, we need some graph theory. We also need some fuzzy graph theory concepts. Those concepts and the main results are given. We provide an algorithm to solve the fuzzy marriage problem
Keywords :
fuzzy set theory; graph theory; problem solving; fuzzy graph theory; fuzzy marriage problem solving; graph theory; marriage theorem; Bipartite graph; Computer science; Fuzzy sets; Graph theory; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fuzzy Information Processing Society, 2000. NAFIPS. 19th International Conference of the North American
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-6274-8
Type :
conf
DOI :
10.1109/NAFIPS.2000.877464
Filename :
877464
Link To Document :
بازگشت