1633 search results - page 9 / 327 » Planar Map Graphs |
DMTCS
2010
13 years 5 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
ARSCOM
2006
13 years 7 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
JCT
2008
13 years 7 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
NIPS
2007
13 years 9 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...