The Clique Problem in Ray Intersection Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Clique Problem in Ray Intersection Graphs

Published:2013-09-04 Issue:3 Volume:50 Page:771-783
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Cabello Sergio,Cardinal Jean,Langerman Stefan

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-013-9538-5.pdf

Reference13 articles.

1. Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Comput. Geom. 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., Šá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, Heidelberg (2006)

4. Chalopin, J., Gonçalves, D.: Every planar graph is the intersection graph of segments in the plane. In: 41st Annual ACM Symposium on Theory of Computing, STOC, pp. 631–638. ACM, New York (2009)

5. Engebretsen, L., Holmerin, J.: Clique is hard to approximate within $$n^{1-o(1)}$$ n 1 - o ( 1 ) . In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP’00), pp. 2–12. Springer, Heidelberg (2000)

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proper colorability of segment intersection graphs;Journal of Combinatorial Optimization;2024-05

2. Perfect Matchings with Crossings;Algorithmica;2023-07-18

3. Perfect Matchings with Crossings;Lecture Notes in Computer Science;2022

4. Proper Colorability of Segment Intersection Graphs;Lecture Notes in Computer Science;2022

5. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3