Sciweavers

1105 search results - page 52 / 221
» Linear choosability of graphs
Sort
View
CAGD
2006
73views more  CAGD 2006»
14 years 12 months ago
Rational surfaces with linear normals and their convolutions with rational surfaces
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
Maria Lucia Sampoli, Martin Peternell, Bert Jü...
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 1 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
UAI
2004
15 years 1 months ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 12 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
DAC
2003
ACM
16 years 25 days ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski