The Clique Problem in Ray Intersection Graphs
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-33090-2_22.pdf
Reference13 articles.
1. Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Computational Geometry 34(2), 83–95 (2006)
2. Ambühl, C., Wagner, U.: The clique problem in intersection graphs of ellipses and triangles. Theory Comput. Syst. 38(3), 279–292 (2005)
3. Bang-Jensen, J., Reed, B., Schacht, M., Sámal, R., Toft, B., Wagner, U.: On six problems posed by Jarik Nešetřil. In: Klazar, M., Kratochvíl, J., Loebl, M., Matoušek, J., Thomas, R., Valtr, P. (eds.) Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26, pp. 613–627. Springer (2006)
4. Chalopin, J., Gonçalves, D.: Every planar graph is the intersection graph of segments in the plane. In: STOC, pp. 631–638 (2009)
5. Lecture Notes in Computer Science;L. Engebretsen,2000
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques;Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications;2014
2. On Intersection Graphs of Convex Polygons;Lecture Notes in Computer Science;2014
3. The Maximum Clique Problem in Multiple Interval Graphs;Algorithmica;2013-09-11
4. On the Recognition of Four-Directional Orthogonal Ray Graphs;Mathematical Foundations of Computer Science 2013;2013
5. Beyond Homothetic Polygons: Recognition and Maximum Clique;Algorithms and Computation;2012
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3