<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

Browsing by Author "HUNG, CN"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item type:Item,
    FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
    (1991-09-13)
    HSU, LH
    ;
    JAN, RH
    ;
    LEE, YC
    ;
    HUNG, CN
    ;
    CHERN, MS
  • Thumbnail Image
    Item type:Item,
    THE MOST VITAL EDGES OF MATCHING IN A BIPARTITE GRAPH
    (1993-07-01)
    HUNG, CN
    ;
    HSU, LH
    ;
    SUNG, TY
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Let G = (VE) be an undirected graph having an edge weight w(e) greater-than-or-equal-to 0 for each e is-an-element-of E. An edge is called a most vital edge (with respect to weighted matching) if its removal from G results in the largest decrease in the total weight of the maximum weighted matching. In this paper, we study the most vital edges of matching in a weighted bipartite graph. We present an 0(n3) algorithm to obtain the most vital edges.