#TITLE_ALTERNATIVE#
ABSTRACT: <br /> <br /> <br /> <br /> <br /> In general to determine a maximal matching with smallest cardinality of an arbitrary graph is a difficult problem. In this final project, the author studies minimum maximal matchings on certain classes of graphs. The aut...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/6240 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | ABSTRACT: <br />
<br />
<br />
<br />
<br />
In general to determine a maximal matching with smallest cardinality of an arbitrary graph is a difficult problem. In this final project, the author studies minimum maximal matchings on certain classes of graphs. The author also developes three algorithms to find maximal matchings of small cardinality. Those algorithms are applied on the aforementioned classes of graphs. The algorithms are then applied using programming language of Visual Basic 6.0. |
|---|