Maximum K-vertex covers for some classes of graphs.
Leung Chi Wai. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. === Includes bibliographical references (leaves 52-57). === Abstracts in English and Chinese. === Abstract --- p.i === Acknowledgement --- p.iii === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Motivations ---...
Other Authors: | Leung, Chi Wai. |
---|---|
Format: | Others |
Language: | English Chinese |
Published: |
2005
|
Subjects: | |
Online Access: | http://library.cuhk.edu.hk/record=b5892587 http://repository.lib.cuhk.edu.hk/en/item/cuhk-325442 |
Similar Items
-
Graph Convexity and Vertex Orderings
by: Anderson, Rachel Jean Selma
Published: (2014) -
Graph Convexity and Vertex Orderings
by: Anderson, Rachel Jean Selma
Published: (2014) -
Distributed minimum vertex coloring and maximum independent set in chordal graphs
by: Konrad, C., et al.
Published: (2022) -
A fast practical algorithm for the vertex separation of unicyclic graphs
by: Markov, Minko Marinov.
Published: (2008) -
On graph approximation heuristics :
an application to vertex cover on planar graphs
by: Meek, Darrin Leigh
Published: (2008)