New clique and independent set algorithms for circle graphs-Reference-Cited by-同舟云学术

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

New clique and independent set algorithms for circle graphs

Published:1992-03 Issue:1 Volume:36 Page:1-24
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Apostolico Alberto,Atallah Mikhail J.,Hambrusch Susanne E.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference20 articles.

1. Notes on searching in multidimensional monotone arrays;Aggarwal,1988

2. The Design and Analysis of Computer Algorithms;Aho,1974

3. Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings;Apostolico;Inform. Process. Lett.,1986

4. Efficient parallel algorithms for string editing and related problems;Apostolico;Purdue CS Tech. Rept.,1987

5. Efficient stable set and clique finding algorithms for overlap graphs;Buckingham,1981

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

1. Computing maximum independent set on outerstring graphs and their relatives;Computational Geometry;2022-04

2. New Formulation for Coloring Circle Graphs And its Application to Capacitated Stowage Stack Minimization;SSRN Electronic Journal;2022

3. Computing Maximum Independent Set on Outerstring Graphs and Their Relatives;Lecture Notes in Computer Science;2019

4. Efficient all path score computations on grid graphs;Theoretical Computer Science;2014-03

5. Fast Distance Multiplication of Unit-Monge Matrices;Algorithmica;2013-09-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP