Titlebook: ;

T-cell

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




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




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




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




書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次




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




書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用




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




書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋




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

種族被根除

The Maximum Weight Stable Set Problem in (,, bull)-Free Graphs,We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices .,?.,?.,?.,?. and edges .,?.,?.,?.,?.).

畏縮

Graph-Theoretic Concepts in Computer Science978-3-662-53536-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

確定方向

蕨類

Approximate Association via Dissociation,or a single edge. Interestingly, . is then precisely a graph containing no induced .’s or containing no .’s, respectively. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum (weighted) dissociation set probl

certain

Geodetic Convexity Parameters for Graphs with Few Short Induced Paths,tion posed by Araujo et al., we show that computing the geodetic hull number of a given .-free graph is NP-hard. Similarly, we show that computing the geodetic interval number of a given .-free graph is NP-hard. On the positive side, we identify several graph classes for which the geodetic hull numb

certain

construct

Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results, Here, we tackle this problem under the framework of parameterized complexity. In particular, we first show to what extend the result of [.] - saving colors from the trivial bound of . on the chromatic number - extends to Max Coloring. Then we consider possible improvements of these results by consi

簡(jiǎn)潔

Finding Two Edge-Disjoint Paths with Length Constraints,dges and the length of each . satisfies ., where .. We regard . and . as parameters and investigate the parameterized complexity of the above problem when at least one of . and . has a length constraint (note that .” indicates that . has no length constraint). For the nine different cases of ., we o

elastic