Crossing Number and Weighted Crossing Number of Near-Planar Graphs

ISSN： 0178-4617

Source： Algorithmica, Vol.60, Iss.3, 2011-07, pp. : 484-504

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A new lower bound for the bipartite crossing number with applications

By Shahrokhi F. Sykora O. Szekely L.A. Vrt'o I.

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 281-294

Elsevier

Access to resources Recommend Favorite

Crossing Numbers of Graphs with Rotation Systems

By Pelsmajer Michael Schaefer Marcus Štefankovič Daniel

Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. : 679-702

Springer Publishing Company

Access to resources Recommend Favorite

Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization

By de Werra D.

Annals of Operations Research, Vol. 149, Iss. 1, 2007-02 ,pp. : 67-73

Springer Publishing Company

Access to resources Recommend Favorite

Inequalities for the Number of Walks in Graphs

By Täubig Hanjo Weihmann Jeremias Kosub Sven Hemmecke Raymond Mayr Ernst

Algorithmica, Vol. 66, Iss. 4, 2013-08 ,pp. : 804-828

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

By Hong Seok-Hee Nagamochi Hiroshi

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 1122-1158

Springer Publishing Company

Access to resources Recommend Favorite