Time-stamped graphs and their associated influence digraphs
โ Scribed by Eddie Cheng; Jerrold W Grossman; Marc J Lipman
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 185 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
โฆ Synopsis
A time-stamped graph is an undirected graph with a real number on each edge. Vertex u in uences vertex v if there is a non-decreasing path from u to v. The associated in uence digraph of a time-stamped graph is the directed graph that records the in uences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated in uence 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 in uence digraph. A number of other questions are also explored.
๐ SIMILAR VOLUMES
## Abstract Methods to minimize the effect of cold ischaemia on porcine islet isolation were investigated. Forty pancreata were randomized to intraductal collagenase delivery in University of Wisconsin solution (UW) or Hanks balanced salt solution (HBSS) (control) both before and after 65 min of co
## Abstract Significant rainfall declines have been observed across much of southern Australia over the last 50 years. In particular, strong declines occurred in the southwest of Western Australia (SWWA) from the late 1960s with further declines in the late 1990s, and in the southwest of eastern Au