scientific article; zbMATH DE number 139926

MaRDI QIDQ4028271zbMATH OpenFDO

Authors Alfred J. Boals, Jamal Nouh

Publication date 28 March 1993

zbMATH Keywords

treepathsNP-complete problemdominant setedge enhancementpair- connected reliabilitydominant edgegraphic set of sequencetraffic sequencetraffic vector

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 5130020
• Edge-based traffic engineering for OSPF networks
• On edge connectivity and parity factor
• Edge‐tenacious networks
• scientific article; zbMATH DE number 1950506
• Traffic matrix inference in IP networks
• Understanding edge connectivity in the Internet through core decomposition

Cited in

(4)

• On edge connectivity and parity factor
• On total traffic domination in non-complete graphs
• New discoveries of domination between traffic matrices
• Domination Between Traffic Matrices

This page was built for publication:

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