منابع مشابه
Stage-graph Representations
We consider graph applications of the well-known paradigm “killing two birds with one stone”. In the plane, this gives rise to a stage graph as follows: vertices are the points, and {u, II} is an edge if and only if the (infinite, straight) line segment joining u to u intersects the stage. Such graphs are shown to be comparability graphs of ordered sets of dimension 2. Similar graphs can be con...
متن کاملStage-graph Representations Jj Org-r Udiger Sack Y{k
We consider graph applications of the well-known paradigm \killing two birds with one stone". In the plane, this gives rise to a stage graph as follows: vertices are the points, and fu; vg is an edge if and only if the (innnite, straight) line segment joining u to v intersects the stage. Such graphs are shown to be comparability graphs of ordered sets of dimension 2. Similar graphs can be const...
متن کاملGraph Representations and Traversal
A graph G = (V,E), where V is the set of vertices, and E is the set of edges. An edge e ∈ E is an unordered pair (u,v) in undirected graphs, where u,v∈V . In directed graphs, an edge e is an ordered pair. A path from a vertex u to a vertex v is a sequence of vertices (w0,w1, ...wk), where u = w0, v = wk and (wi−1,wi) ∈ E for all 1 ≤ i ≤ k. The path is a cycle if u = v. The length of a path in a...
متن کاملTwo-stage threshold representations
We study two-stage choice procedures in which the decision maker first preselects the alternatives whose values according to a criterion pass a menu-dependent threshold and then maximizes a second criterion to narrow the selection further. This framework overlaps with several existing models that have various interpretations and impose various additional restrictions on behavior. We show that t...
متن کاملExtended Compact Web Graph Representations
Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within main memory. These representations at least provide fast navigation (to the neighbors of a node), yet more sophisticated operations are desirable for several Web analyses. We present a compact Web graph representation that, in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00080-7