34 results on '"Wagner, Donald K."'
Search Results
2. Delta–wye reduction of almost-planar graphs
3. Editorial Statements
4. An Almost Linear-Time Algorithm for Graph Realization
5. Nonseparating Cocircuits in Binary Matroids
6. On thek-cut subgraph polytope
7. A polynomial-time simplex method for the maximumk-flow problem
8. Decomposition of 3-connected graphs
9. A circuit characterization of graphic matroids
10. A note on immersion minors and planarity
11. A Characterization of Graphic Matroids Based on Circuit Orderings
12. Graphs with no K3,3 Minor Containing a Fixed Edge
13. The arborescence-realization problem
14. On Mighton's characterization of graphic matroids
15. Shortest paths in almost acyclic graphs
16. An Almost Linear-Time Algorithm for Graph Realization
17. Minimum-weight cycles in 3-separable graphs
18. The dominant of the 2-connected-Steiner-subgraph polytope for W4-free graphs
19. On the Consecutive-Retrieval Problem
20. Graphs with no K3,3 Minor Containing a Fixed Edge.
21. Uncovering generalized-network structure in matrices
22. Recognizing a class of bicircular matroids
23. Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs
24. Linear Network Optimization: Algorithms and Codes.
25. Decomposing 3-connected graphs
26. Vertex 2-isomorphism
27. Representations of bicircular matroids
28. Disjoint (s, t)‐cuts in a network
29. Forbidden subgraphs and graph decomposition.
30. Weakly 3-Connected Graphs
31. Connectivity in bicircular matroids
32. Recognizing max-flow min-cut path matrices
33. On the complexity of recognizing a class of generalized networks
34. On theorems of Whitney and Tutte
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.