Titlebook: ;

HARDY

書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)




書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名




書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度




書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Graph-Theoretic Concepts in Computer Science被引頻次




書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名




書目名稱Graph-Theoretic Concepts in Computer Science年度引用




書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名




書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋




書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名

線

Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequalif finding a minimum-weight perfect matching in complete graphs satisfying the triangle inequality. The algorithm is conceptually very simple and has a work measure within a factor of ... of the best exact sequential algorithm. This is the first . approximation algorithm for the problem with a sub-li

征稅

Hierarchically specified unit disk graphs,PACE-hardness results and polynomial time approximations are presented for most of the problems considered. These problems include ...Our PSPACE-hardness results imply the PSPACE-hardness of the geometric location problems in [MS84, WK88], when sets of points are specified hierarchically as in [BOW8

高調(diào)

Bounded tree-width and LOGCFL,ations on .-sourced graphs—on tree-width bounded graphs belong to the complexity class LOGCFL. This is the lowest complexity class known for these problems. Our result complements the research in a series of papers [1, 2, 3, 5, 8, 9, 12, 15, 16] by Arnborg, Bodlaender, Chandrasekharan, Courcelle, He

表被動

Atmosphere

Algorithms and complexity of sandwich problems in graphs (extended abstract),lems generalize recognition problems and arise in various applications. Concentrating mainly on subfamilies of perfect graphs, we give polynomial algorithms for several families and prove the NP-completeness of others.

Atmosphere

ASTER

ABIDE

媽媽不開心

Dynamic algorithms for graphs with treewidth 2,s for graphs with treewidth at most 2 (also called: partial 2-trees, or series-parallel graphs), and for almost trees with parameter .. Each operation can be performed in .(log .) time. For a large number of graph decision, optimization and counting problems, information can be maintained using .(lo