Engineering Notes
Created by admin on Thu, 17/05/2012 - 16:59
Sub Topic:
Vertex Descriptors and Graph Coloring
Upload File:
Department:
Chapter Name:
GraphTheory
Description:
The problem of vertex partitioning in graphs can be solved in different ways [1],[2]. The most frequently used discriminating criteria are well-known square matrices that collect contributions of pairs of vertices from the graph
Add new comment