Pages that link to "Item:Q3800056"

The following pages link to An Almost Linear-Time Algorithm for Graph Realization (Q3800056):

Displaying 33 items.

• Characterizing graphic matroids by a system of linear equations (Q461731) (← links)
• Bond graphs. III: Bond graphs and electrical networks (Q678853) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
• Locating facilities which interact: Some solvable cases (Q689235) (← links)
• Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
• ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
• The structure of bases in bicircular matroids (Q912110) (← links)
• On the complexity of recognizing directed path families (Q967290) (← links)
• Integrality properties of edge path tree families (Q1043594) (← links)
• Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
• Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
• Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
• Recognizing hidden bicircular networks (Q1208462) (← links)
• A heuristic for finding embedded network structure in mathematical programmes (Q1261396) (← links)
• On testing consecutive-ones property in parallel (Q1281757) (← links)
• Computational implementation of Fujishige's graph realizability algorithm (Q1296050) (← links)
• Uncovering generalized-network structure in matrices (Q1308737) (← links)
• Distance realization problems with applications to internet tomography (Q1604199) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• The arborescence-realization problem (Q1893159) (← links)
• Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
• Linear time construction of indexable elastic founder graphs (Q2169983) (← links)
• Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
• On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
• Recognizing binet matrices (Q2638382) (← links)
• A deterministic \(O(m \log m)\) time algorithm for the Reeb graph (Q2874588) (← links)
• Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
• A Characterization of Graphic Matroids Based on Circuit Orderings (Q4643301) (← links)
• Nonseparating Cocircuits in Binary Matroids (Q5020847) (← links)
• Finding and using directed cuts of real graphs of algorithms (Q5930916) (← links)