A Matrix Approach to Hypergraph Stable Set and Coloring Problems with Its Application to Storing Problem
This paper considers the stable set and coloring problems of hypergraphs and presents several new results and algorithms using the semitensor product of matrices. By the definitions of an incidence matrix of a hypergraph and characteristic logical vector of a vertex subset, an equivalent algebraic c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/783784 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!