文档详情

说明for introduction to matchings介绍匹配.pptx

发布:2024-08-02约小于1千字共7页下载文档
文本预览下载声明

IntroductiontoMatchings

BipartiteGraphsAbipartitegraphisagraphwherethenodesareintwodistinctsetsEveryedgeconnectsamemberofthefirstsettoamemberofthesecondsetABipartitegraphNotaBipartitegraph

CompleteBipartiteGraphsABipartitegraphiscompleteifeverynodeinonesetisconnectedtoeverynodeoftheothersetItisdescribedas wheremisthenumberofverticesinoneset,andnthenumberintheother

MatchingsAmatchingisasubsetoftheedgesofabipartitegraphsuchthatnonodehasmorethanoneedgeinthematchingThisisaMATCHINGThisisnotaMatching

MaximalMatchingsAmatchingismaximalifitisnotpossibletoaddmoreedgesNotmaximalMaximal

CompleteMatchingsAmatchingiscompleteif:thetwosetshavethesamenumberofverticesthematchingincludeseveryvertexThisisacompletematchingNotethatthematchingcanbecompleteevenifthebipartitegraphisnot

TheEnd

显示全部
相似文档