Keyword: graphical methods

Found 53 papers in total
The codispersion map: a graphical tool to visualize the association between two spatial variables
The codispersion map: a graphical tool to visualize the association between two spatial variables
2015,
The codispersion coefficient quantifies the association between two spatial processes...
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Enumeration of the facets of cut polytopes over some highly symmetric graphs
2016,
We report here a computation giving the complete list of facets for the cut polytopes...
Teaching ‘Instant Experience’ with Graphical Model Validation Techniques
Teaching ‘Instant Experience’ with Graphical Model Validation Techniques
2014,
Graphical model validation techniques for linear normal models are often used to check...
A numerical approach to compute the topology of the Apparent Contour of a smooth mapping from ℝ2 to ℝ2
A numerical approach to compute the topology of the Apparent Contour of a smooth mapping from ℝ2 to ℝ2
2014,
A rigorous algorithm for computing the topology of the Apparent Contour of a generic...
Construction of PH splines based on H-Bézier curves
Construction of PH splines based on H-Bézier curves
2014,
There is considerable interest in the properties of PH curves in geometric modeling...
Practical and Efficient Circle Graph Recognition
Practical and Efficient Circle Graph Recognition
2014,
Circle graphs are the intersection graphs of chords in a circle. This paper presents...
Maxwell’s reciprocal diagrams and discrete Michell frames
Maxwell’s reciprocal diagrams and discrete Michell frames
2013,
This paper unites two major legacies of James Clerk Maxwell’s...
Selecting control factor values in a robust design using a scatter plot
Selecting control factor values in a robust design using a scatter plot
2011,
When the results of an experimental design are analyzed, in which control factors and...
A review on probabilistic graphical models in evolutionary computation
A review on probabilistic graphical models in evolutionary computation
2012,
Thanks to their inherent properties, probabilistic graphical models are one of the...
Approximation and Tidying–A Problem Kernel for s‐Plex Cluster Vertex Deletion
Approximation and Tidying–A Problem Kernel for s‐Plex Cluster Vertex Deletion
2012,
We introduce the NP‐hard graph‐based data clustering problem s ‐...
Drawing (Complete) Binary Tanglegrams
Drawing (Complete) Binary Tanglegrams
2012,
A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are...
Polygonal Representations of Digital Sets
Polygonal Representations of Digital Sets
2004,
In the context of discrete curve evolution the following problem is of relevance:...
A Graphical and Numerical Method for Selection of Variables in Linear Models
A Graphical and Numerical Method for Selection of Variables in Linear Models
2006,
A model is usually only an approximation of underlying reality. To access this reality...
Algorithms for Coloring Quadtrees
Algorithms for Coloring Quadtrees
2002,
We describe simple linear time algorithms for coloring the squares of balanced and...
Quasi‐Upward Planarity
Quasi‐Upward Planarity
2002,
An upward planar drawing of a directed graph (digraph) is a planar drawing such that...
A Near‐Linear Area Bound for Drawing Binary Trees
A Near‐Linear Area Bound for Drawing Binary Trees
2002,
We present several simple methods to construct planar, strictly upward, strongly...
An Exact Exponential Time Algorithm for Power Dominating Set
An Exact Exponential Time Algorithm for Power Dominating Set
2012,
The Power Dominating Set problem is an extension of the well‐known domination...
Bipartite Matching in the Semi‐streaming Model
Bipartite Matching in the Semi‐streaming Model
2012,
We present the first deterministic 1+ ϵ approximation algorithm for finding...
Generalized f‐contraction for a pair of mappings on cone metric spaces
Generalized f‐contraction for a pair of mappings on cone metric spaces
2011,
Using the setting of cone metric space, a fixed point theorem is proved for two maps,...
A wide‐ranging computational comparison of high‐performance graph colouring algorithms
A wide‐ranging computational comparison of high‐performance graph colouring algorithms
2012,
This paper reviews the current state of the literature surrounding methods for the...
A new DSATUR‐based algorithm for exact vertex coloring
A new DSATUR‐based algorithm for exact vertex coloring
2012,
This paper describes a new exact algorithm PASS for the vertex coloring problem based...
The Dense k ‐Subgraph Problem
The Dense k ‐Subgraph Problem
2001,
This paper considers the problem of computing the dense k ‐vertex subgraph of a...
A One‐Step Crust and Skeleton Extraction Algorithm
A One‐Step Crust and Skeleton Extraction Algorithm
2001,
We wish to extract the topology from scanned maps. In previous work [GNY] this was...
Uniquely Restricted Matchings
Uniquely Restricted Matchings
2001,
A matching in a graph is a set of edges no two of which share a common vertex. In this...
Papers per page: