The weighted sitting closer to friends than enemies problem in the line
From MaRDI portal
Publication:2099388
DOI10.1007/s10878-022-00953-zOpenAlexW4309582259MaRDI QIDQ2099388
Christopher Thraves Caro, Julio Aracena
Publication date: 23 November 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.11812
metric spacesweighted graphsRobinsonian matricesSeriation problemthe SCFE problemvalid distance drawings
Programming involving graphs or networks (90C35) (n)-dimensional polytopes (52B11) Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- An optimal algorithm to recognize Robinsonian dissimilarities
- A structural characterization for certifying Robinsonian matrices
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Recognition of Robinsonian dissimilarities
- A Lex-BFS-based recognition algorithm for Robinsonian matrices
- The weighted sitting closer to friends than enemies problem in the line
- Embedding signed graphs in the line
- The dimension of valid distance drawings of signed graphs
- Sitting closer to friends than enemies, revisited
- Robinsonian matrices: recognition challenges
- Combinatorial Data Analysis
- Can Everybody Sit Closer to Their Friends Than Their Enemies?
- Seriation and matrix reordering methods: An historical overview
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
