895 search results - page 42 / 179 » Using graphs for some discrete tomography problems |
116
click to vote
WSC
1998
15 years 4 months ago
1998
This paper explores the use of discrete-event simulation for the design and control of physical protection systems for fixed-site facilities housing items of significant value. It...
116
click to vote
SODA
2010
ACM
16 years 12 days ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
120
click to vote
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
107
click to vote
INFOVIS
2005
IEEE
15 years 8 months ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
125
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...