Login / Signup
An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence.
Prantik Biswas
Chumki Acharya
Nirupam Chakrabarti
Shreyasi Das
Abhisek Paul
Paritosh Bhattacharya
Published in:
WCI (2015)
Keyphrases
</>
computational complexity
small number
fixed number
machine learning
input data
information retrieval
social networks
information systems
image processing
pairwise
random walk
directed acyclic graph
graph model
maximum number
determine the optimal number