An application of vertex packing to data analysis in the evaluation of pavement deterioration

DOI10.1016/0167-6377(81)90018-3MaRDI QIDQ1165769zbMATH OpenOpenAlexFDO

Authors Eliane A. Gattass, G. L. Nemhauser

Publication date 1981

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(81)90018-3

zbMATH Keywords

data analysisdeterioration of pavementgreedy algorithminterval graphsmaximum cardinality vertex packing problempavement managementproper internal graph

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of mathematical programming (90C90)

Cites work

• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)

Cited in

(3)

• Interval graphs and related topics
• Algorithmic aspects of intersection graphs and representation hypergraphs
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: An application of vertex packing to data analysis in the evaluation of pavement deterioration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165769)