Showing 1 - 1 results of 1 for search 'undirected graph', query time: 0.02s Refine Results
  1. 1
    An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem
    “… optimal or near optimal vertex cover for any known undirected, un-weighted graph. The MNMA adds a vertex…”
    Get full text
    Get full text
    Get full text
Search Tools: RSS Feed – Email Search