A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs.
Geir AgnarssonJill Bigley DunhamPublished in: SIAM J. Discret. Math. (2011)
Keyphrases
- maximum number
- directed graph
- weighted graph
- undirected graph
- spanning tree
- real world graphs
- edge information
- graph matching
- massive graphs
- graph mining
- graph partitioning
- graph model
- directed acyclic graph
- graph theory
- graph representation
- edge weights
- series parallel
- spectral embedding
- minimum cost
- database
- graph data