Zobrazeno 1 - 2
of 2
pro vyhledávání: '"李權明"'
Autor:
Chuan-Min Lee, 李權明
94
Graphs and graph algorithms are pervasive and fundamental in computer science. There are many interesting computational and practical problems defined in terms of graphs. The domination problem is one of the most important graph optimization
Graphs and graph algorithms are pervasive and fundamental in computer science. There are many interesting computational and practical problems defined in terms of graphs. The domination problem is one of the most important graph optimization
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/67867661979781529065
Autor:
Chuan-Min Lee, 李權明
88
A feedback vertex set F of a graph G=(V,E) is a subset of V such that the grpah induced by V\F has no cycles. If each vertex v of G is associated with a real number w(v), called the weight of vertex v, then G is a weighted graph.The weighted
A feedback vertex set F of a graph G=(V,E) is a subset of V such that the grpah induced by V\F has no cycles. If each vertex v of G is associated with a real number w(v), called the weight of vertex v, then G is a weighted graph.The weighted
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/54796525875927691416