2014
DOI: 10.12988/ams.2014.45343
|View full text |Cite
|
Sign up to set email alerts
|

Clique cover of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…The value of θ k is equal to the clique cover number of G k cc to ensure that the number of subsystems used for distributed pattern recognition is minimal. The clique cover number of G (i.e., the total number of subsystems used for distributed pattern recognition) is then equal to the sum of the clique cover number of its connected components …”
Section: Forward Selection For Distributed Pattern Recognitionmentioning
confidence: 99%
“…The value of θ k is equal to the clique cover number of G k cc to ensure that the number of subsystems used for distributed pattern recognition is minimal. The clique cover number of G (i.e., the total number of subsystems used for distributed pattern recognition) is then equal to the sum of the clique cover number of its connected components …”
Section: Forward Selection For Distributed Pattern Recognitionmentioning
confidence: 99%