# An Alternative Method to Crossing Minimization on Hierarchical Graphs (extended abstract)

Mutzel, Petra (1997) An Alternative Method to Crossing Minimization on Hierarchical Graphs (extended abstract). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 318-333(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_57).

Full text not available from this repository.

## Abstract

A common method for drawing directed graphs is, as a first step, to partition the vertices into a set of k levels and then, as a second step, to permute the vertices within the levels such that number of crossings is minimized. We suggest an alternative method for second step, namely, removing the minimal number of edges such that the resulting graph is k-level planar. For the final diagram the removed edges are reinserted into a k-level planar drawing. Hence, instead of considering the k-level crossing minimization problem, we suggest solving the k-level planarization problem. In this paper we adress the case k=2. First, we give a motivation for our approach. Then, we adress the problem of extracting a 2-level planar subgraph of maximum weight in a given 2-level graph. This problem is np-hard. Based on characterization of 2-level planar graphs, we give an integer linear programming formulation for the 2-level planarization problem. Moreover, we define and investigate the polytope 2LPS(G) associated with the set of all 2-level planar subgraphs of a given 2-level graph G. We will see that this polytope has full dimensionand and that the inqualities occuring in the integer linear description are facet-defining for 2LPS(G). The inqualities in the integer linear programming formulation can be separated in polynomial time, hence they can be used efficiently in a cutting plane method for solving practical instances of the 2-level planarization problem. Furthermore, we derive new inqualities that substantially improve the quality of the obtained solution. We report on first computational results.

Item Type: Conference Paper 10.1007/3-540-62495-3_57 M Methods > M.500 LayeredG Algorithms and Complexity > G.999 OthersG Algorithms and Complexity > G.420 CrossingsP Styles > P.480 Layered http://gdea.informatik.uni-koeln.de/id/eprint/197 View Item
{"ft_lang_label":"__label__en","ft_lang_prob":0.8602635,"math_prob":0.752552,"size":2092,"snap":"2021-43-2021-49","text_gpt3_token_len":475,"char_repetition_ratio":0.12452107,"word_repetition_ratio":0.039473683,"special_character_ratio":0.22418737,"punctuation_ratio":0.12276215,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.955062,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-04T17:27:53Z\",\"WARC-Record-ID\":\"<urn:uuid:ba2eaf1c-d86f-4196-9299-439987068446>\",\"Content-Length\":\"25652\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7f85e71d-5b08-4c05-8442-62c7266dc234>\",\"WARC-Concurrent-To\":\"<urn:uuid:3a1a8012-c279-4901-90bb-d2e1b2d78089>\",\"WARC-IP-Address\":\"134.95.9.240\",\"WARC-Target-URI\":\"http://gdea.informatik.uni-koeln.de/197/\",\"WARC-Payload-Digest\":\"sha1:D5SSDZ6COWL3ORWJDDCK2N55W2BACTOY\",\"WARC-Block-Digest\":\"sha1:PGLMZWPCEYUXIZMTC3E5GHHPVWHR2FWV\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362999.66_warc_CC-MAIN-20211204154554-20211204184554-00218.warc.gz\"}"}