Inequalities for the Number of Walks in Graphs

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

Publisher： Springer Publishing Company

ISSN： 0178-4617

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

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

Biased random walks on resource network graphs for load balancing

By Randles M.   Abu-Rahmeh O.   Johnson P.   Taleb-Bendiab A.  

The Journal of Supercomputing, Vol. 53, Iss. 1, 2010-07 ,pp. : 138-162

Springer Publishing Company

Access to resources Recommend Favorite

Quantum walks, Ihara zeta functions and cospectrality in regular graphs

By Ren Peng  

Quantum Information Processing, Vol. 10, Iss. 3, 2011-06 ,pp. : 405-417

Springer Publishing Company

Access to resources Recommend Favorite

Crossing Number and Weighted Crossing Number of Near-Planar Graphs

By Cabello Sergio   Mohar Bojan  

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

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

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