|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-11805-0 |
| 003 |
DE-He213 |
| 005 |
20230406035441.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100305s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642118050
|9 978-3-642-11805-0
|
| 024 |
7 |
|
|a 10.1007/978-3-642-11805-0
|2 doi
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 050 |
|
4 |
|a QA297.4
|
| 072 |
|
7 |
|a UYAM
|2 bicssc
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a UYAM
|2 thema
|
| 072 |
|
7 |
|a PBD
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Graph Drawing
|h [electronic resource] :
|b 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers /
|c edited by David Eppstein, Emden R Gansner.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a 426 p. 199 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5849
|
| 505 |
0 |
|
|a Invited 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 of DAGs -- 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 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a User interfaces (Computer systems).
|
| 650 |
|
0 |
|a Human-computer interaction.
|
| 650 |
1 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Mathematical Applications in Computer Science.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Models of Computation.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a User Interfaces and Human Computer Interaction.
|
| 700 |
1 |
|
|a Eppstein, David.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Gansner, Emden R.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642118067
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642118043
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5849
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-11805-0
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
