Time-stamped graphs and their associated influence digraphs. Cheng, E., Grossman, J. W, & Lipman, M. J Discrete Applied Mathematics, 128(2):317–335, June, 2003. 32 citations (Semantic Scholar/DOI) [2025-10-11] 20 citations (Crossref/DOI) [2025-02-07]
Paper doi abstract bibtex A time-stamped graph is an undirected graph with a real number on each edge. Vertex u influences vertex v if there is a non-decreasing path from u to v. The associated influence digraph of a time-stamped graph is the directed graph that records the influences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated influence digraph has n vertices and t arcs. We also investigate the minimum number of vertices a graph can have so that a given digraph is an induced subgraph of its associated influence digraph. A number of other questions are also explored.
@article{cheng_time-stamped_2003,
title = {Time-stamped graphs and their associated influence digraphs},
volume = {128},
issn = {0166-218X},
url = {https://www.sciencedirect.com/science/article/pii/S0166218X02004973},
doi = {10.1016/S0166-218X(02)00497-3},
abstract = {A time-stamped graph is an undirected graph with a real number on each edge. Vertex u influences vertex v if there is a non-decreasing path from u to v. The associated influence digraph of a time-stamped graph is the directed graph that records the influences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated influence digraph has n vertices and t arcs. We also investigate the minimum number of vertices a graph can have so that a given digraph is an induced subgraph of its associated influence digraph. A number of other questions are also explored.},
number = {2},
urldate = {2025-02-07},
journal = {Discrete Applied Mathematics},
author = {Cheng, Eddie and Grossman, Jerrold W and Lipman, Marc J},
month = jun,
year = {2003},
note = {32 citations (Semantic Scholar/DOI) [2025-10-11]
20 citations (Crossref/DOI) [2025-02-07]},
pages = {317--335},
}
Downloads: 0
{"_id":"wEokx5qruhMjWjbb9","bibbaseid":"cheng-grossman-lipman-timestampedgraphsandtheirassociatedinfluencedigraphs-2003","author_short":["Cheng, E.","Grossman, J. W","Lipman, M. J"],"bibdata":{"bibtype":"article","type":"article","title":"Time-stamped graphs and their associated influence digraphs","volume":"128","issn":"0166-218X","url":"https://www.sciencedirect.com/science/article/pii/S0166218X02004973","doi":"10.1016/S0166-218X(02)00497-3","abstract":"A time-stamped graph is an undirected graph with a real number on each edge. Vertex u influences vertex v if there is a non-decreasing path from u to v. The associated influence digraph of a time-stamped graph is the directed graph that records the influences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated influence digraph has n vertices and t arcs. We also investigate the minimum number of vertices a graph can have so that a given digraph is an induced subgraph of its associated influence digraph. A number of other questions are also explored.","number":"2","urldate":"2025-02-07","journal":"Discrete Applied Mathematics","author":[{"propositions":[],"lastnames":["Cheng"],"firstnames":["Eddie"],"suffixes":[]},{"propositions":[],"lastnames":["Grossman"],"firstnames":["Jerrold","W"],"suffixes":[]},{"propositions":[],"lastnames":["Lipman"],"firstnames":["Marc","J"],"suffixes":[]}],"month":"June","year":"2003","note":"32 citations (Semantic Scholar/DOI) [2025-10-11] 20 citations (Crossref/DOI) [2025-02-07]","pages":"317–335","bibtex":"@article{cheng_time-stamped_2003,\n\ttitle = {Time-stamped graphs and their associated influence digraphs},\n\tvolume = {128},\n\tissn = {0166-218X},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0166218X02004973},\n\tdoi = {10.1016/S0166-218X(02)00497-3},\n\tabstract = {A time-stamped graph is an undirected graph with a real number on each edge. Vertex u influences vertex v if there is a non-decreasing path from u to v. The associated influence digraph of a time-stamped graph is the directed graph that records the influences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated influence digraph has n vertices and t arcs. We also investigate the minimum number of vertices a graph can have so that a given digraph is an induced subgraph of its associated influence digraph. A number of other questions are also explored.},\n\tnumber = {2},\n\turldate = {2025-02-07},\n\tjournal = {Discrete Applied Mathematics},\n\tauthor = {Cheng, Eddie and Grossman, Jerrold W and Lipman, Marc J},\n\tmonth = jun,\n\tyear = {2003},\n\tnote = {32 citations (Semantic Scholar/DOI) [2025-10-11]\n20 citations (Crossref/DOI) [2025-02-07]},\n\tpages = {317--335},\n}\n\n\n\n\n\n\n\n","author_short":["Cheng, E.","Grossman, J. W","Lipman, M. J"],"key":"cheng_time-stamped_2003","id":"cheng_time-stamped_2003","bibbaseid":"cheng-grossman-lipman-timestampedgraphsandtheirassociatedinfluencedigraphs-2003","role":"author","urls":{"Paper":"https://www.sciencedirect.com/science/article/pii/S0166218X02004973"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/hegera","dataSources":["MjyMYAXhzMT5PBaZ2"],"keywords":[],"search_terms":["time","stamped","graphs","associated","influence","digraphs","cheng","grossman","lipman"],"title":"Time-stamped graphs and their associated influence digraphs","year":2003}