An Almost Linear-Time Algorithm for Graph Realization
From MaRDI portal
Recommendations
Cited in
(46)- Integrality properties of edge path tree families
- Vertex covering by paths on trees with its applications in machine translation
- Decomposition and optimization over cycles in binary matroids
- Layering strategies for creating exploitable structure in linear and integer programs
- Recognizing hidden bicircular networks
- A heuristic for finding embedded network structure in mathematical programmes
- On testing consecutive-ones property in parallel
- Computational implementation of Fujishige's graph realizability algorithm
- Uncovering generalized-network structure in matrices
- Distance realization problems with applications to internet tomography
- Future paths for integer programming and links to artificial intelligence
- The arborescence-realization problem
- Independence and port oracles for matroids, with an application to computational learning theory
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Linear-time LUP decomposition of forest-like matrices
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Linear time construction of indexable elastic founder graphs
- Recognizing Helly edge-path-tree graphs and their clique graphs
- On computing the Galois lattice of bipartite distance hereditary graphs
- Recognizing binet matrices
- A deterministic O(m m) time algorithm for the Reeb graph
- Twins in Subdivision Drawings of Hypergraphs
- scientific article; zbMATH DE number 3862960 (Why is no real title available?)
- scientific article; zbMATH DE number 3896660 (Why is no real title available?)
- scientific article; zbMATH DE number 3966135 (Why is no real title available?)
- scientific article; zbMATH DE number 3976776 (Why is no real title available?)
- Realization of Matrices and Directed Graphs
- On the Consecutive-Retrieval Problem
- Characterizing graphic matroids by a system of linear equations
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
- A characterization of graphic matroids based on circuit orderings
- Nonseparating Cocircuits in Binary Matroids
- Finding and using directed cuts of real graphs of algorithms
- Bond graphs. III: Bond graphs and electrical networks
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Implied integrality in mixed-integer optimization
- Locating facilities which interact: Some solvable cases
- Temporal graph realization from fastest paths
- A mathematical programming approach for recognizing binet matrices
- Realizing temporal transportation trees
- Exact algorithms and applications for tree-like Weighted Set Cover
- ILIGRA: an efficient inverse line graph algorithm
- The structure of bases in bicircular matroids
- Intersection representations of matrices by subtrees and unicycles on graphs
- An approach to improving the Mayeda method for graph realization from a matrix
- On the complexity of recognizing directed path families
This page was built for publication: An Almost Linear-Time Algorithm for Graph Realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800056)
