Incidence matrices, interval graphs and seriation in archeology
From MaRDI portal
Publication:2536060
DOI10.2140/pjm.1969.28.565zbMath0185.03301OpenAlexW2166395672MaRDI QIDQ2536060
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
Related Items
An optimal algorithm to recognize Robinsonian dissimilarities ⋮ An integer programming model for the Minimum Interval Graph Completion Problem ⋮ Algorithmic characterizations of interval orderd hypergraphs and applications ⋮ Optimal patchings for consecutive ones matrices ⋮ Uniform embeddings for Robinson similarity matrices ⋮ Abundance matrices and seriation in archaeology ⋮ Inducing a blockmodel structure of two-mode binary data using seriation procedures ⋮ Simultaneous representation of interval and interval-containment orders ⋮ Characterizing circular-arc graphs ⋮ Abundance matrices and seriation in archaeology ⋮ Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence ⋮ Unnamed Item ⋮ Recognition of Robinsonian dissimilarities ⋮ Heuristic methods to consecutive block minimization ⋮ Cliques that are tolerance digraphs ⋮ Minimal Obstructions for Partial Representations of Interval Graphs ⋮ An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem ⋮ Chronological rectangle digraphs which are two-terminal series-parallel ⋮ Satisfiability problems on intervals and unit intervals ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ Interval graphs with side (and size) constraints ⋮ A characterization of unit interval bigraphs of open and closed intervals ⋮ Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances ⋮ Estimation of Monge matrices ⋮ Integral mixed unit interval graphs ⋮ On Robinsonian dissimilarities, the consecutive ones property and latent variable models ⋮ Optimal rates of statistical seriation ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ Modeling recreational systems using optimization techniques and information technologies ⋮ Minimal obstructions for partial representations of interval graphs ⋮ A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices ⋮ \texttt{PQser:} a Matlab package for spectral seriation ⋮ Minimal cutwidth linear arrangements of abelian Cayley graphs ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ Counting endpoint sequences for interval orders and interval graphs ⋮ Fixed-parameter complexity of minimum profile problems ⋮ Unit Interval Graphs of Open and Closed Intervals ⋮ A structural characterization for certifying Robinsonian matrices ⋮ Bridges between deterministic and probabilistic models for binary data ⋮ A new characterization of matrices with the consecutive ones property ⋮ A conjunctive parallelogram model for Pick any/\(n\) data ⋮ Unnamed Item ⋮ On the interval completion of chordal graphs ⋮ Mixed unit interval graphs ⋮ Chronological orderings of interval digraphs ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Music genomics: Determining musical similarities with seriation algorithms ⋮ Information storage and retrieval - mathematical foundations. II: Combinatorial problems ⋮ Faster and enhanced inclusion-minimal cograph completion ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms ⋮ Constructing blockmodels: how and why ⋮ The seriation problem and the travelling salesman problem ⋮ Preemptive scheduling and antichain polyhedra ⋮ Seriation and matrix reordering methods: An historical overview ⋮ On the consecutive ones property ⋮ The intersection graphs of subtrees in trees are exactly the chordal graphs ⋮ A survey of statistical problems in archaeological dating ⋮ Double Semiorders and Double Indifference Graphs ⋮ Chronological orderings of interval graphs ⋮ Polynomial-time local-improvement algorithm for consecutive block minimization ⋮ Chronological Orderings of Interval Digraph ⋮ Networks and vehicle routing for municipal waste collection ⋮ Minimising the number of gap-zeros in binary matrices ⋮ Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
