T-cell
发表于 2025-3-21 19:51:54
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0388040<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0388040<br><br> <br><br>
种族被根除
发表于 2025-3-21 23:27:30
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 ., ., ., ., .).
畏缩
发表于 2025-3-22 00:30:41
Graph-Theoretic Concepts in Computer Science978-3-662-53536-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
确定方向
发表于 2025-3-22 04:36:21
http://reply.papertrans.cn/39/3881/388040/388040_4.png
蕨类
发表于 2025-3-22 12:01:32
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
发表于 2025-3-22 14:12:20
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
发表于 2025-3-22 17:10:47
http://reply.papertrans.cn/39/3881/388040/388040_7.png
construct
发表于 2025-3-22 23:26:10
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
简洁
发表于 2025-3-23 02:13:31
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
发表于 2025-3-23 07:24:19
http://reply.papertrans.cn/39/3881/388040/388040_10.png