Maximum weighted independent sets on transitive graphs and applications

DOI10.1016/S0167-9260(98)00017-0zbMath0909.68107OpenAlexW1969257177WikidataQ127344056 ScholiaQ127344056MaRDI QIDQ4225377

Dimitri Kagaris, Spyros Tragoudas

Publication date: 12 January 1999

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9260(98)00017-0

zbMATH Keywords

high-level synthesischannel routingdelay testingmaximum weighted independent sets

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (3)

Minimum cost and list homomorphisms to semicomplete digraphs ⋮ Conversion of coloring algorithms into maximum weight independent set algorithms ⋮ On the complexity of the independent set problem in triangle graphs

This page was built for publication: Maximum weighted independent sets on transitive graphs and applications