scientific article; zbMATH DE number 1788255

MaRDI QIDQ4550498zbMATH OpenFDO

Authors Cristian Vidraşcu

Publication date 25 August 2002

zbMATH Keywords

minimal coverability graphparallel/distributed systemsPetri nets

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• Minimal cut cover of a graph with an application to the testing of electronic boards
• Approximating the minimum tour cover of a digraph
• Dumbbell graphs with extremal (reverse) cover cost
• A note on minimal matching covered graphs
• Min-max tree covers of graphs.

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 Q4550498)