Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: In: Graph drawing : 11th International Symposium, GD 2003, Perugia, Italy, September 21 - 24, 2003; revised papers / Liotta, Giuseppe (Hrsg.). - Berlin [u.a.] : Springer, 2004. - (Lecture notes in computer science ; 2912). - S. 357-368. - ISBN 978-3-540-20831-0

Classification: Informatik

Event: Veröffentlichung

(where): Konstanz

(who): Bibliothek der Universität Konstanz

(when): 2009

Creator: Brandes, Ulrik
Cornelsen, Sabine
Wagner, Dorothea

URN: urn:nbn:de:bsz:352-opus-73348

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 11:01 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Brandes, Ulrik
Cornelsen, Sabine
Wagner, Dorothea
Bibliothek der Universität Konstanz

Time of origin

2009

Other Objects (12)

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

Hochschulschrift

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Eager st-Ordering

Hochschulschrift | Online-Publikation

Layout of Graph Visualizations

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Konferenzschrift | Kongress

Network analysis : methodological foundations

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Eager st-Ordering

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

Using Graph Layout to Visualize Train Interconnection Data

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

Hochschulschrift

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Eager st-Ordering

Hochschulschrift | Online-Publikation

Layout of Graph Visualizations

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Konferenzschrift | Kongress

Network analysis : methodological foundations

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Eager st-Ordering

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

Using Graph Layout to Visualize Train Interconnection Data

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

Hochschulschrift

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Eager st-Ordering

Hochschulschrift | Online-Publikation

Layout of Graph Visualizations

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Konferenzschrift | Kongress

Network analysis : methodological foundations

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Eager st-Ordering

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

Using Graph Layout to Visualize Train Interconnection Data

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read and agree to the privacy policy for the collection of personal data.*

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Show object

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Eager st-Ordering

Layout of Graph Visualizations

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Network analysis : methodological foundations

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Eager st-Ordering

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

Using Graph Layout to Visualize Train Interconnection Data

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Eager st-Ordering

Layout of Graph Visualizations

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Network analysis : methodological foundations

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Eager st-Ordering

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

Using Graph Layout to Visualize Train Interconnection Data

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Eager st-Ordering

Layout of Graph Visualizations

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Network analysis : methodological foundations

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Eager st-Ordering

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

Using Graph Layout to Visualize Train Interconnection Data

Related objects

Reset password