On the public citation graph

b-matching degree-sequence polyhedra

https://doi.org/10.1007/bf01205074

0 signed · 32 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/net.3230130405openalex-snapshot

The perfectly matchable subgraph polytope of a bipartite graph

inferredcites →https://doi.org/10.1007/bf01580137openalex-snapshot

A greedy algorithm for solving a certain class of linear programmes

inferredcites →https://doi.org/10.1007/bf01589420openalex-snapshot

Directed submodularity, ditroids and directed submodular flows

inferredcites →https://doi.org/10.1007/bf02125345openalex-snapshot

The perfectly Matchable Subgraph Polytope of an arbitrary graph

inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot

The ellipsoid method and its consequences in combinatorial optimization

inferredcites →https://doi.org/10.1007/bf02604639openalex-snapshot

Greedy algorithm and symmetric matroids

inferredcites →https://doi.org/10.1016/0001-8708(86)90104-0openalex-snapshot

Some combinatorial properties of discriminants in metric vector spaces

inferredcites →https://doi.org/10.1016/0012-365x(88)90101-xopenalex-snapshot

Pseudomatroids

inferredcites →https://doi.org/10.1016/0024-3795(89)90470-9openalex-snapshot

The polytope of degree sequences

inferredcites →https://doi.org/10.1016/0095-8956(73)90037-3openalex-snapshot

Extreme degree sequences of simple graphs

inferredcites →https://doi.org/10.1016/0166-218x(90)90023-6openalex-snapshot

On totally dual integral systems

inferredcites →https://doi.org/10.1016/0166-218x(92)90272-copenalex-snapshot

Matchings and ▵-matroids

inferredcites →https://doi.org/10.1016/0167-6377(87)90027-7openalex-snapshot

On T-joins and odd factors

inferredcites →https://doi.org/10.1016/0167-6377(87)90055-1openalex-snapshot

On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jctb.1997.1744openalex-snapshot

The Membership Problem in Jump Systems

inferred← citeshttps://doi.org/10.1007/3-540-45535-3_13openalex-snapshot

Bisubmodular Function Minimization

inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_29openalex-snapshot

Minsquare Factors and Maxfix Covers of Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_40openalex-snapshot

Towards Minimizing k-Submodular Functions

inferred← citeshttps://doi.org/10.1007/bf01581694openalex-snapshot

A separation algorithm for the matchable set polytope

inferred← citeshttps://doi.org/10.1007/s10107-008-0242-9openalex-snapshot

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

inferred← citeshttps://doi.org/10.1007/s13160-022-00499-xopenalex-snapshot

Discrete Fenchel duality for a pair of integrally convex and separable convex functions

inferred← citeshttps://doi.org/10.1007/s13160-023-00589-4openalex-snapshot

Recent progress on integrally convex functions

inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot

Chapter 3 Matching

inferred← citeshttps://doi.org/10.1080/02331939508844117openalex-snapshot

The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions

inferred← citeshttps://doi.org/10.1137/060651136openalex-snapshot

Minconvex Factors of Prescribed Size in Graphs

inferred← citeshttps://doi.org/10.1137/s0895480103426339openalex-snapshot

Bisubmodular Function Minimization

inferred← citeshttps://doi.org/10.1137/s0895480191222926openalex-snapshot

Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra

inferred← citeshttps://doi.org/10.1137/s0895480194264344openalex-snapshot

A Min--Max Theorem for Bisubmodular Polyhedra

inferred← citeshttps://doi.org/10.1287/moor.28.1.92.14263openalex-snapshot

A Separation Algorithm for b -Matching Degree-Sequence Polyhedra

inferred← citeshttps://doi.org/10.15807/jorsj.38.362openalex-snapshot

A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM

inferred← citeshttps://doi.org/10.15807/jorsj.40.437openalex-snapshot

BALANCED BISUBMODULAR SYSTEMS AND BIDIRECTED FLOWS

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.