瀏覽 的方式: 關鍵字 Graph Algorithms

跳到: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
或是輸入前幾個字:  
顯示 1 到 16 筆資料,總共 16 筆
題名作者日期
A linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid GraphsChen, Hon-Chan; Wang, Yue-Li2006-10-26
A Variation of Minimum Latency ProblemHuang, Yung-Hui; Liny, Yaw-Ling; Tang, Chuan-Yi2006-10-25T05:55:45Z
An optimal algorithm for solving the weighted median problem on the weighted 4-cactus graphsLan, Yu-Feng; Wang, Yue-li2006-10-24T07:58:27Z
An Algorithm for the Optimal Ranking Problem on Interval GraphsWang, Chen-Wen; Yu, Ming-Shing2006-10-26
An Approximate Algorithm for Evolutionary Tree Reconstruction from Distance MatrixWu, B.Y.; Tang, C.Y.2006-10-26
Bottleneck independent domination on some classes of graphsYen, C. K.2006-10-25T05:44:42Z
Circular trapezoid graphs and circle trapezoid graphs: characteristics and algorithmsLin, Yaw-Ling2006-10-24T09:12:31Z
Edge domination of distance-hereditary graphsChang, Maw-Shang; Yang, Rue-Lin2006-10-24T08:55:34Z
Hamiltonian Problems on Ptolemaic GraphsChang, Maw-Shang; Wu, Shaur-Ching2006-10-25T05:57:03Z
On the complexity of the maximum biplanar subgraph problemChang, Wu-Yu2006-10-24T08:19:22Z
On the Complexity of the Perfect Edge Domination ProblemLu, Chin; Tang, Chuan2006-10-26
On the maximum connected interval subgraph of block grraphs and chain graphsPeng, Sheng-Lung; Chao, Hsiao-An; Chang, Ruay-Shiung2006-10-25T05:46:55Z
On the powers of graphs with bounded asteroidal numberHo, Ting-Yem; Chang, Jou-Ming; Wang, Yue-Li2006-10-24T08:50:46Z
Parameterized tractability of some (efficient) Y -domination variants for planar graphs and t-degenerate graphsCai, Leizhen; Kloks, Ton2006-10-25T05:48:12Z
Solving the all-pair-shortest-length problem on chordal bipartite graphsHo, Chin-Wen; Chang, Jou-Ming2006-10-24T09:02:15Z
The NP-completeness of Edge RankingLam, T.W.; Yue, F.L.2006-10-26