An algorithm for finding the influence digraph of a time-stamped graph

MaRDI QIDQ3616011zbMATH OpenFDO

Authors Drew J. Lipman, Marc J. Lipman

Publication date 24 March 2009

zbMATH Keywords

algorithmcollaboration graphinfluence digraphtime stamped graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Complete bipartite graphs as induced subgraphs of an influence digraph of a time-stamped graphs
• scientific article; zbMATH DE number 5139473
• Time-stamped graphs and their associated influence digraphs
• Induced paths in the influence digraph of a time-stamped graph
• An introduction to temporal graphs: an algorithmic perspective

Cited in

(4)

• Time-stamped graphs and their associated influence digraphs
• scientific article; zbMATH DE number 5139473 (Why is no real title available?)
• Induced paths in the influence digraph of a time-stamped graph
• Complete bipartite graphs as induced subgraphs of an influence digraph of a time-stamped graphs

This page was built for publication: An algorithm for finding the influence digraph of a time-stamped graph

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