000 | 05188nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-642-11805-0 | ||
003 | DE-He213 | ||
005 | 20240730181612.0 | ||
007 | cr nn 008mamaa | ||
008 | 100305s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642118050 _9978-3-642-11805-0 |
||
024 | 7 |
_a10.1007/978-3-642-11805-0 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aGraph Drawing _h[electronic resource] : _b17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers / _cedited by David Eppstein, Emden R Gansner. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_a426 p. 199 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5849 |
|
505 | 0 | _aInvited Talks -- Why Are String Graphs So Beautiful? -- The Art of Cheating When Drawing a Graph -- Papers -- Drawing Hamiltonian Cycles with No Large Angles -- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings -- On the Perspectives Opened by Right Angle Crossing Drawings -- Drawing 3-Polytopes with Good Vertex Resolution -- Planar Drawings of Higher-Genus Graphs -- Splitting Clusters to Get C-Planarity -- On the Characterization of Level Planar Trees by Minimal Patterns -- Characterization of Unlabeled Radial Level Planar Graphs -- Upward Planarization Layout -- More Flexible Radial Layout -- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations -- Port Constraints in Hierarchical Layout of Data Flow Diagrams -- Fast Edge-Routing for Large Graphs -- Leftist Canonical Ordering -- Succinct Greedy Drawings Do Not Always Exist -- Geometric Simultaneous Embeddings of a Graph and a Matching -- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs -- Removing Independently Even Crossings -- Manhattan-Geodesic Embedding of Planar Graphs -- Orthogonal Connector Routing -- On Rectilinear Drawing of Graphs -- Semi-bipartite Graph Visualization for Gene Ontology Networks -- On Open Problems in Biological Network Visualization -- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View -- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs -- Drawing Trees in a Streaming Model -- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree -- Drawing Planar 3-Trees with Given Face-Areas -- 3D Visibility Representations by Regular Polygons -- Complexity of Some Geometric and Topological Problems -- On Planar Supports for Hypergraphs -- DAGmaps and ?-Visibility Representations ofDAGs -- Drawing Directed Graphs Clockwise -- An Improved Algorithm for the Metro-line Crossing Minimization Problem -- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection -- Posters -- GMap: Drawing Graphs as Maps -- Using High Dimensions to Compare Drawings of Graphs -- On ?-Constrained Upward Topological Book Embeddings -- 4-Labelings and Grid Embeddings of Plane Quadrangulations -- IBM ILOG Graph Layout for Eclipse -- Layout Techniques Coupled with Web2.0-Based Business Process Modeling -- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles -- Visualization of Complex BPEL Models -- DAGmaps and Dominance Relationships -- Scaffold Hunter - Interactive Exploration of Chemical Space -- Graph Drawing Contest -- Graph Drawing Contest Report. | |
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aUser interfaces (Computer systems). _911681 |
|
650 | 0 |
_aHuman-computer interaction. _96196 |
|
650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aMathematical Applications in Computer Science. _931683 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aModels of Computation. _931806 |
650 | 2 | 4 |
_aSymbolic and Algebraic Manipulation. _955589 |
650 | 2 | 4 |
_aUser Interfaces and Human Computer Interaction. _931632 |
700 | 1 |
_aEppstein, David. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9125492 |
|
700 | 1 |
_aGansner, Emden R. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9125493 |
|
710 | 2 |
_aSpringerLink (Online service) _9125494 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642118043 |
776 | 0 | 8 |
_iPrinted edition: _z9783642118067 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5849 _9125495 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-11805-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c90982 _d90982 |