...
机译:关于可比图的图搜索能力
Univ Toronto, Dept Comp Sci, Toronto, ON M5S3G4, Canada;
CNRS, UMR 7089, LIAFA, F-75205 Paris 13, France|Univ Paris Diderot, F-75205 Paris 13, France;
CNRS, UMR 7089, LIAFA, F-75205 Paris 13, France|Univ Paris Diderot, F-75205 Paris 13, France;
Brandenburg Tech Univ Cottbus, Math Inst, D-03044 Cottbus, Germany;
cocomparability graphs; comparability graphs; partial orders; linear extensions; graph algorithms; classical graph searches; lexicographic depth first search; LDFS; minimum path cover problem; recognition of permutation graphs;
机译:二分体类似物的可比性和Cocomparity图
机译:在可比性图中计数独立集合
机译:分裂图和可比图的弯曲数上的界
机译:B_0-VPG Cocomparity图的表征和2D可视化
机译:通过顶点排序的可比图上的高效算法
机译:自供电的两面Mo2C-石墨烯/Sb2S0.42Se2.58/TiO2光电探测器中作为电极的Mo2C-石墨烯杂化膜的受控生长
机译:可比性图中的距离及其功效
机译:有界维数Cocomparability图的Treewidth和pathwidth