-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm.
Ying XiaoChristoforos N. HadjicostisKrishnaiyan ThulasiramanPublished in: COCOON (2006)
Keyphrases
- cost function
- preprocessing
- undirected graph
- optimal solution
- probabilistic model
- learning algorithm
- closed form
- context free parsing
- hamiltonian cycle
- approximation ratio
- recognition algorithm
- matching algorithm
- detection algorithm
- computational complexity
- objective function
- error bounds
- np hard
- image segmentation
- k means
- minimum spanning tree
- error correcting codes
- polynomial time approximation
- error tolerance
- finding the shortest path