Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Alejandro Estrella-Balderrama"'
Autor:
Jeffrey D. Ullman, Jun Xu, Chad Whipkey, Nitin Gangahar, Stephan Ellner, Alejandro Estrella-Balderrama, Bart Samwel, Gokul Nath Babu Manoharan, Himani Apte, Karl Schnaitter, Stephan Gudmundson, Larysa Aharkava, Ben Handy, Divyakant Agrawal, Apurv Gupta, Sridatta Chegu, Shivakumar Venkataraman
Publikováno v:
SIGMOD Conference
We describe Shasta, a middleware system built at Google to support interactive reporting in complex user-facing applications related to Google's Internet advertising business. Shasta targets applications with challenging requirements: First, user que
Publikováno v:
International Journal of Foundations of Computer Science. 16:71-88
This paper proposes a procedure to design fault tolerant algorithms for the R-Mesh and some of its restrictive variations. This procedure first identifies a healthy sub-mesh from a faulty model using the bypass and removal fault model. Then it uses s
Autor:
Petra Mutzel, Michael Kaufmann, Ulrik Brandes, Markus Geyer, Antonios Symvonis, Giuseppe Liotta, Cesim Erten, Alejandro Estrella-Balderrama, Stephen G. Kobourov, J. Joseph Fowler, Carsten Gutwenger, Fabrizio Frati, Seok-Hee Hong
Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to represent the same object as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b28aa301c5afe7f778cff02fcf06f6f
https://hdl.handle.net/11729/416
https://hdl.handle.net/11729/416
Publikováno v:
Graph Drawing ISBN: 9783642118043
Graph Drawing
Graph Drawing
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns. Fowler and Kobourov [7] later proved that the set of patterns was inc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::856f075f74422fc55d7aea6a6be3a4de
https://doi.org/10.1007/978-3-642-11805-0_9
https://doi.org/10.1007/978-3-642-11805-0_9
Publikováno v:
Graph Drawing ISBN: 9783642002182
Graph Drawing
Graph Drawing
Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET , designed to allow the investigation of a wide range of embedding problems. GraphS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::910bdbd81d3dc32aacfa473ece449bd5
https://doi.org/10.1007/978-3-642-00219-9_17
https://doi.org/10.1007/978-3-642-00219-9_17
Autor:
Alejandro Estrella-Balderrama, Michael Schulz, Michael Jünger, Merijam Percan, Elisabeth Gassner, Marcus Schaefer
Publikováno v:
Graph Drawing ISBN: 9783540775362
Graph Drawing
Graph Drawing
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be placed in the plane in such a way that for each graph the straight-line d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::793a44a903cb618da0c26cd11615fa9c
https://doi.org/10.1007/978-3-540-77537-9_28
https://doi.org/10.1007/978-3-540-77537-9_28
Publikováno v:
Graph Drawing ISBN: 9783540709039
Graph Drawing
Graph Drawing
We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98f2212c922a65d217193eb143169243
https://doi.org/10.1007/978-3-540-70904-6_11
https://doi.org/10.1007/978-3-540-70904-6_11
Publikováno v:
Graph Drawing ISBN: 9783540709039
Graph Drawing
Graph Drawing
Consider a graph G drawn in the plane so that each vertex lies on a distinct horizontal line lj = {(x, j) | x ∈ R}. The bijection φ that maps the set of n vertices V to a set of distinct horizontal lines lj forms a labeling of the vertices. Such a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a264cff705a58675fcc83ae661ea0b7
https://doi.org/10.1007/978-3-540-70904-6_35
https://doi.org/10.1007/978-3-540-70904-6_35
Publikováno v:
IPDPS
Summary form only given. This paper considers fault-tolerance on the R-Mesh and LR-Mesh models. We propose a technique to identify a healthy submesh from a faulty model using the removal fault model. Then, we use scalable algorithms to simulate the f
Publikováno v:
Computational Geometry. (6-7):704-721
Consider a graph G with vertex set V in which each of the n vertices is assigned a number from the set {1,…,k} for some positive integer k. This assignment ϕ is a labeling if all k numbers are used. If ϕ does not assign adjacent vertices the same