Search
Abstract
In the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance on trees [8].
Authors (4)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Language:
- English
- Publication year:
- 2020
- Bibliographic description:
- Wereszko K., Kozakiewicz R., Lewoń R., Małafiejski M.: Tight bounds on global edge and complete alliances in trees// / : , 2020,
- Verified by:
- Gdańsk University of Technology
seen 97 times