Now showing items 1-1 of 1
| Abstract: | The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes |
| Description: | Algorithmica (2010) 57: 207–216 DOI 10.1007/s00453-008-9200-4 |
| URI: | http://dyuthi.cusat.ac.in/purl/4193 |
| Files | Size |
|---|---|
| Computing median and antimedian sets in median.pdf | (290.4Kb) |
Now showing items 1-1 of 1
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.