Incidence matrices, interval graphs and seriation in archeology
From MaRDI portal
Publication:2536060
DOI10.2140/PJM.1969.28.565zbMATH Open0185.03301OpenAlexW2166395672MaRDI QIDQ2536060FDOQ2536060
Authors: David George Kendall
Publication date: 1969
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1969.28.565
Cited In (64)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- Cliques that are tolerance digraphs
- Minimal obstructions for partial representations of interval graphs
- Counting endpoint sequences for interval orders and interval graphs
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- Bridges between deterministic and probabilistic models for binary data
- An optimal algorithm to recognize Robinsonian dissimilarities
- A generalization of interval orders
- Uniform embeddings for Robinson similarity matrices
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- Satisfiability problems on intervals and unit intervals
- The seriation problem and the travelling salesman problem
- A new characterization of matrices with the consecutive ones property
- A structural characterization for certifying Robinsonian matrices
- Chronological orderings of interval graphs
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Double Semiorders and Double Indifference Graphs
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Networks and vehicle routing for municipal waste collection
- Optimal patchings for consecutive ones matrices
- Simultaneous representation of interval and interval-containment orders
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Fixed-parameter complexity of minimum profile problems
- Recognition of Robinsonian dissimilarities
- Heuristic methods to consecutive block minimization
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- Minimising the number of gap-zeros in binary matrices
- Characterizing circular-arc graphs
- A conjunctive parallelogram model for Pick any/\(n\) data
- On the interval completion of chordal graphs
- Chronological orderings of interval digraphs
- On Robinsonian dissimilarities, the consecutive ones property and latent variable models
- Modeling recreational systems using optimization techniques and information technologies
- Interval graphs with side (and size) constraints
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- \texttt{PQser:} a Matlab package for spectral seriation
- Polynomial Kernel for Interval Vertex Deletion
- Preemptive scheduling and antichain polyhedra
- Mixed unit interval graphs
- Seriation and matrix reordering methods: An historical overview
- On the consecutive ones property
- An integer programming model for the minimum interval graph completion problem
- Polynomial-time local-improvement algorithm for consecutive block minimization
- Chronological rectangle digraphs which are two-terminal series-parallel
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Abundance matrices and seriation in archaeology
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- Minimal cutwidth linear arrangements of abelian Cayley graphs
- Minimal obstructions for partial representations of interval graphs
- A survey of statistical problems in archaeological dating
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems
- Optimal rates of statistical seriation
- Estimation of Monge matrices
- Constructing blockmodels: how and why
- Unit interval graphs of open and closed intervals
- Integral mixed unit interval graphs
- Chronological Orderings of Interval Digraph
- Music genomics: determining musical similarities with seriation algorithms
- A characterization of unit interval bigraphs of open and closed intervals
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- Unit interval graphs: a story with open ends
- Abundance matrices and seriation in archaeology
This page was built for publication: Incidence matrices, interval graphs and seriation in archeology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536060)