scientific article; zbMATH DE number 4002122

zbMATH Open0618.05026MaRDI QIDQ3754636FDOQ3754636

R. Procesi Ciampi

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• Network reliability and acyclic orientations
• Generating the Acyclic Orientations of a Graph
• Computing rooted communication reliability in an almost acyclic digraph
• An algorithm for enumerating all spanning trees of a directed graph
• Activity preserving bijections between spanning trees and orientations in graphs

zbMATH Keywords

polynomial algorithmacyclic orientation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (8)

• Exact periodic wave solutions for the modified Zakharov equations with a quantum correction
• Title not available (Why is that?)
• Fixed topology Steiner trees and spanning forests
• Activity preserving bijections between spanning trees and orientations in graphs
• Acyclic, connected and tree sets
• Spanning trees and function classes
• Title not available (Why is that?)
• Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces

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