Accession Number ADA573102
Title Results on the Min-Sum Vertex Cover Problem.
Publication Date 2006
Media Count 13p
Personal Author C. Rasmussen P. Stanica R. Gera S. Horton
Abstract Let G be a graph with the vertex set V(G), edge set E(G). A vertex labeling is a bijection f : V(G) - 1, 2, . . . . (V(G)). The weight of e=uv 2 E(G) is given by g(e) = min9f(u),f(v). The min-sum vertex cover (msvc) is a vertex labeling that minimum such ...
Keywords Bounds
Graphs
Independence
Labeling
Vertex covers


 
Source Agency Non Paid ADAS
NTIS Subject Category 72B - Algebra, Analysis, Geometry, & Mathematical Logic
Corporate Author Naval Postgraduate School, Monterey, CA. Dept. of Applied Mathematics.
Document Type Journal article
Title Note Journal article.
NTIS Issue Number 1317
Contract Number N/A

Science and Technology Highlights

See a sampling of the latest scientific, technical and engineering information from NTIS in the NTIS Technical Reports Newsletter

Acrobat Reader Mobile    Acrobat Reader