Pages that link to "Item:Q2536060"

The following pages link to Incidence matrices, interval graphs and seriation in archeology (Q2536060):

Displaying 50 items.

• Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
• An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
• An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
• Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
• A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
• Bridges between deterministic and probabilistic models for binary data (Q537421) (← links)
• Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
• Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
• \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
• Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
• Mixed unit interval graphs (Q713160) (← links)
• Chronological orderings of interval graphs (Q795848) (← links)
• Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
• Inducing a blockmodel structure of two-mode binary data using seriation procedures (Q856645) (← links)
• Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
• Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
• A new characterization of matrices with the consecutive ones property (Q967442) (← links)
• Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems (Q1235990) (← links)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
• Constructing blockmodels: how and why (Q1245783) (← links)
• The seriation problem and the travelling salesman problem (Q1252153) (← links)
• On the consecutive ones property (Q1281779) (← links)
• Algorithmic characterizations of interval orderd hypergraphs and applications (Q1329816) (← links)
• Simultaneous representation of interval and interval-containment orders (Q1362579) (← links)
• Recognition of Robinsonian dissimilarities (Q1378872) (← links)
• Cliques that are tolerance digraphs (Q1382269) (← links)
• Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
• Optimal rates of statistical seriation (Q1715546) (← links)
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
• A survey of statistical problems in archaeological dating (Q1845608) (← links)
• Integral mixed unit interval graphs (Q1949108) (← links)
• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
• Optimal patchings for consecutive ones matrices (Q2125569) (← links)
• Estimation of Monge matrices (Q2203631) (← links)
• A conjunctive parallelogram model for Pick any/\(n\) data (Q2259997) (← links)
• Polynomial-time local-improvement algorithm for consecutive block minimization (Q2345864) (← links)
• Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
• Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
• On Robinsonian dissimilarities, the consecutive ones property and latent variable models (Q2442774) (← links)
• Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition (Q2445688) (← links)
• A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices (Q2462311) (← links)
• On the interval completion of chordal graphs (Q2492201) (← links)
• Chronological orderings of interval digraphs (Q2497527) (← links)
• The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
• Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence (Q2654152) (← links)
• Heuristic methods to consecutive block minimization (Q2664289) (← links)
• A generalization of interval orders (Q2741281) (← links)
• Music genomics: determining musical similarities with seriation algorithms (Q2788716) (← links)
• Unit interval graphs: a story with open ends (Q2857436) (← links)