Login / Signup
A matroid analogue of a theorem of Brooks for graphs.
James G. Oxley
Published in:
Eur. J. Comb. (2016)
Keyphrases
</>
greedy algorithm
graph theoretic
graph theory
structured objects
weighted graph
graph model
von neumann
graph mining
data sets
bipartite graph
random graphs
graph construction
graph structures
graph matching
adjacency matrix
subgraph isomorphism
combinatorial optimization