Titlebook: ;

ARSON

書目名稱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é)科排名

要素

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

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.

弓箭

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

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

,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

Clinch

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

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