Sciweavers

1633 search results - page 148 / 327
» Planar Map Graphs
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 12 hour ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
CIKM
2008
Springer
14 years 19 days ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 10 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
BIRTHDAY
2005
Springer
14 years 4 months ago
Flexible Interconnection of Graph Transformation Modules
Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connec...
Gregor Engels, Reiko Heckel, Alexey Cherchago
COMBINATORICS
2006
183views more  COMBINATORICS 2006»
13 years 10 months ago
On Oriented Arc-Coloring of Subcubic Graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
Alexandre Pinlou