1105 search results - page 38 / 221 » Linear choosability of graphs |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
102
click to vote
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
APAL
2008
14 years 10 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...