ARSON
发表于 2025-3-21 17:15:52
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0388027<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0388027<br><br> <br><br>
要素
发表于 2025-3-21 23:41:37
Scheduling with incompatible jobs,proximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.
Self-Help-Group
发表于 2025-3-22 03:22:56
Generalized coloring for tree-like graphs,inear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. We give polynomial algorithms for the corresponding enumeration problems #. and #. on partial k-trees and trees and for #. on cographs.
弓箭
发表于 2025-3-22 04:33:52
Minimum rectilinear steiner trees for intervals on two parallel lines,ws that . (.) is NP-hard, even if each class consists of at most three single points. But we give an exact algorithm that has linear time complexity, if roughly spoken for no vertical line more than a constant number of classes contain points on the right and also not on the right side of this line.
encomiast
发表于 2025-3-22 10:13:38
https://doi.org/10.1007/978-3-322-86871-8mparability graphs and in O(n.) time on cographs. For general graphs, the problem is known to be PSPACE-complete, but can be solved in time, polynomial in the number of isolatable sets of vertices of the graph.
Annotate
发表于 2025-3-22 15:12:23
,Kayles on special classes of graphs — An application of Sprague-Grundy theory,mparability graphs and in O(n.) time on cographs. For general graphs, the problem is known to be PSPACE-complete, but can be solved in time, polynomial in the number of isolatable sets of vertices of the graph.
Annotate
发表于 2025-3-22 17:39:06
http://reply.papertrans.cn/39/3881/388027/388027_7.png
Clinch
发表于 2025-3-22 21:45:47
https://doi.org/10.1007/978-3-8349-3671-4proximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.
separate
发表于 2025-3-23 05:04:07
https://doi.org/10.1007/978-3-658-10317-0inear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. We give polynomial algorithms for the corresponding enumeration problems #. and #. on partial k-trees and trees and for #. on cographs.
convert
发表于 2025-3-23 06:41:57
http://reply.papertrans.cn/39/3881/388027/388027_10.png