Title of article
Matroid representation of clique complexes Original Research Article
Author/Authors
Kenji Kashiwabara، نويسنده , , Yoshio Okamoto، نويسنده , , Takeaki Uno، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
20
From page
1910
To page
1929
Abstract
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique complex of a graph (the collection of all cliques of the graph) which is also called a flag complex, and investigate the minimum number k such that the clique complex of a giv
Keywords
Partition matroid , Matroid intersection , Independence system , Flag complex , Clique complex , Abstract simplicial complex
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886557
Link To Document