On the public citation graph

On weighted multiway cuts in trees

0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/net.3230210106openalex-snapshot
On the multiway cut polyhedron
inferredcites →https://doi.org/10.1006/aama.1993.1001openalex-snapshot
Decompositions of Leaf-Colored Binary Trees
inferredcites →https://doi.org/10.1007/978-3-662-10619-8_4openalex-snapshot
Finding the Minimal Change in a Given Tree
inferredcites →https://doi.org/10.1016/0196-8858(92)90017-qopenalex-snapshot
Evolutionary trees: An integer multicommodity max-flow-min-cut theorem
inferredcites →https://doi.org/10.1016/0302-4598(87)85058-4openalex-snapshot
Lecture Notes in Biomathematics
inferredcites →https://doi.org/10.1090/dimacs/005/07openalex-snapshot
The optimal multiterminal cut problem
inferredcites →https://doi.org/10.1093/sysbio/20.4.406openalex-snapshot
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
inferredcites →https://doi.org/10.1145/129712.129736openalex-snapshot
The complexity of multiway cuts (extended abstract)
inferredcites →https://doi.org/10.2307/2412116openalex-snapshot
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
inferredcites →https://doi.org/10.2307/2529676openalex-snapshot
Minimum Mutation Fits to a Given Tree
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199909)34:2<102::aid-net3>3.0.co;2-xopenalex-snapshot
Analysis of LP relaxations for multiway and multicut problems
inferred← citeshttps://doi.org/10.1002/ecjc.20341openalex-snapshot
Algorithms for the minimum partitioning problems in graphs
inferred← citeshttps://doi.org/10.1006/jcss.1999.1687openalex-snapshot
An Improved Approximation Algorithm for MULTIWAY CUT
inferred← citeshttps://doi.org/10.1007/11671541_8openalex-snapshot
Approximating a Class of Classification Problems
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_39openalex-snapshot
Nonlinear formulations and improved randomized approximation algorithms for multicut problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12683-3_24openalex-snapshot
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny
inferred← citeshttps://doi.org/10.1007/bf02459467openalex-snapshot
Links between maximum likelihood and maximum parsimony under a simple model of site substitution
inferred← citeshttps://doi.org/10.1016/j.aam.2018.09.002openalex-snapshot
The computational complexity of calculating partition functions of optimal medians with Hamming distance
inferred← citeshttps://doi.org/10.1016/j.adhoc.2010.02.005openalex-snapshot
Maximum lifetime continuous query processing in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.cels.2026.101615openalex-snapshot
The tree labeling polytope: A unified approach to ancestral reconstruction problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.05.009openalex-snapshot
Exact algorithms for a discrete metric labeling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.10.037openalex-snapshot
Minimal multicut and maximal integer multiflow: A survey
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.016openalex-snapshot
Multiway cut and integer flow problems in trees
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.043openalex-snapshot
Exact algorithms for a discrete metric labeling problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.027openalex-snapshot
Counting and sampling SCJ small parsimony solutions
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00049-3openalex-snapshot
Minimum multiway cuts in trees
inferred← citeshttps://doi.org/10.1089/cmb.2010.0254openalex-snapshot
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny
inferred← citeshttps://doi.org/10.1089/cmb.2013.0134openalex-snapshot
Exactly Computing the Parsimony Scores on Phylogenetic Networks Using Dynamic Programming
inferred← citeshttps://doi.org/10.1093/bioinformatics/btab691openalex-snapshot
PaReBrick: PArallel REarrangements and BReaks identification toolkit
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029914openalex-snapshot
Multiway k-Cut in Static and Dynamic Graphs: A Maximum Entropy Principle Approach
inferred← citeshttps://doi.org/10.1109/icie.2009.217openalex-snapshot
Colored Multiway Cuts in Generalized Tree Networks
inferred← citeshttps://doi.org/10.1109/ifita.2009.491openalex-snapshot
Colored Multiway Cuts in Trees of Rings
inferred← citeshttps://doi.org/10.1109/tcbb.2008.135openalex-snapshot
A Unified Approach for Reconstructing Ancient Gene Clusters
inferred← citeshttps://doi.org/10.1111/j.1096-0031.2007.00146.xopenalex-snapshot
The case for sensitivity: a response to Grant and Kluge
inferred← citeshttps://doi.org/10.1142/s0218213010000042openalex-snapshot
NENOK — A SOFTWARE ARCHITECTURE FOR GENERIC INFERENCE
inferred← citeshttps://doi.org/10.1145/276698.276711openalex-snapshot
An improved approximation algorithm for multiway cut
inferred← citeshttps://doi.org/10.1186/1471-2105-16-s14-s6openalex-snapshot
Sampling and counting genome rearrangement scenarios
inferred← citeshttps://doi.org/10.3389/fmicb.2021.628622openalex-snapshot
High Rates of Genome Rearrangements and Pathogenicity of Shigella spp.
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6267openalex-snapshot
Computing multiway cut within the given excess over the largest minimum isolating cut
inferred← citeshttps://doi.org/10.48550/arxiv.1304.2170openalex-snapshot
On sampling SCJ rearrangement scenarios
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.