z-logo
open-access-imgOpen Access
A faster algorithm for maximum independent set on interval filament graphs
Author(s) -
Darcy Best,
Max Ward
Publication year - 2022
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00588
Subject(s) - interval (graph theory) , set (abstract data type) , independent set , interval graph , algorithm , computer science , combinatorics , chordal graph , mathematics , discrete mathematics , graph , 1 planar graph , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom