Add to ORKGCoordinated Science Laboratory was formerly known as Control Systems LaboratoryDepartment of the Army / DA-28-043-AMC-00073(E)Department of the Air Force / AF 49(638) - 138
AbstractIn this paper we examine the problem of finding minimum cuts in finite graphs with the side ...
AbstractIn the algorithm for the disjoint paths problem given in Graph Minors XIII, we used without ...
AbstractWe prove the following theorem. Let G = (V, E) be a planar bipartite graph, embedded in the ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
AbstractThis paper discusses an attempt at identifying a property of circuits in (nonplanar) graphs ...
AbstractGiven a planar graph G = (V, E), find k edge-disjoint paths in G connecting k pairs of termi...
AbstractA chord of a circuit C of a matroid M on E is a cell e ϵ S\C such that C spans e. Menger's t...
AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
AbstractWe show that the edge disjoint paths problem is NP-complete in directed or undirected rectan...
AbstractGiven a simple graph G, the graph associahedron KG is a simple polytope whose face poset is ...
AbstractWe prove the following theorem, conjectured by K. Mehlhorn: Let G = (V, E) be a planar graph...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractRecently A. Schrijver proved the following theorem. Suppose that G=(V, E) is a connected pla...
AbstractIn this paper we examine the problem of finding minimum cuts in finite graphs with the side ...
AbstractIn the algorithm for the disjoint paths problem given in Graph Minors XIII, we used without ...
AbstractWe prove the following theorem. Let G = (V, E) be a planar bipartite graph, embedded in the ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
AbstractThis paper discusses an attempt at identifying a property of circuits in (nonplanar) graphs ...
AbstractGiven a planar graph G = (V, E), find k edge-disjoint paths in G connecting k pairs of termi...
AbstractA chord of a circuit C of a matroid M on E is a cell e ϵ S\C such that C spans e. Menger's t...
AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
AbstractWe show that the edge disjoint paths problem is NP-complete in directed or undirected rectan...
AbstractGiven a simple graph G, the graph associahedron KG is a simple polytope whose face poset is ...
AbstractWe prove the following theorem, conjectured by K. Mehlhorn: Let G = (V, E) be a planar graph...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractRecently A. Schrijver proved the following theorem. Suppose that G=(V, E) is a connected pla...
AbstractIn this paper we examine the problem of finding minimum cuts in finite graphs with the side ...
AbstractIn the algorithm for the disjoint paths problem given in Graph Minors XIII, we used without ...
AbstractWe prove the following theorem. Let G = (V, E) be a planar bipartite graph, embedded in the ...