S_{1, 2, 4}, triangle)-free graphs in polynomial time.">S_{1, 2, 4}, triangle)-free graphs in polynomial time., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Maximum weight independent sets for (S1, 2, 4, ..."

Andreas Brandstädt, Raffaele Mosca (2021)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2021.05.027

access: closed

type: Journal Article

metadata version: 2021-07-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/BrandstadtM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BrandstadtM21
Andreas Brandstädt, Raffaele Mosca:
Maximum weight independent sets for (S_{1, 2, 4}, triangle)-free graphs in polynomial time. Theor. Comput. Sci. 878-879: 11-25 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.