Sciweavers

1633 search results - page 50 / 327
» Planar Map Graphs
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 10 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
INFORMATICALT
2006
104views more  INFORMATICALT 2006»
13 years 10 months ago
Algorithms for Inner Magic and Inner Antimagic Labelings of Some Planar Graphs
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
Auparajita Krishnaa, Manohar Singh Dulawat
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
COCOON
2007
Springer
14 years 4 months ago
On the Number of Cycles in Planar Graphs
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
Kevin Buchin, Christian Knauer, Klaus Kriegel, And...