Finding All Minimum Size Separating Vertex Sets in a Graph

A Characterization of the Smallest Eigenvalue of a Graph

Desai, Madhav P.
Rao, Vasant B.

July 1991

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryAir Force Office of S...

Vertex Connectivity of Graphs: Algorithms and Bounds

Kanevsky, Arkady

January 10000

131 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This thesis concerns several ...

Steps into Computational Geometry

Preparata, F.P.

March 1977

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Finding All Minimum Size Separating Vertex Sets in a Graph

Kanevsky, Arkady

July 1988

Coordinated Science Laboratory was formerly known as Control Systems LaboratorySemiconductor Researc...

On Finding the Vertex Connectivity of Graphs

Girkar, Milind
Sohoni, Milind

May 1987

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Compact Representation of the Separating k-Sets of a Graph

Kanevsky, Arkady

January 1988

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foun...

On the Number of Minimum Size Separating Vertex Sets in a Graph

Kanevsky, Arkady

July 1987

National Science Foundation / ECS 84-10902 and 8404866Semiconductor Research Corporation / 86-12-109...

Minimum Polygonal Separation

Edelsbrunner, H.
Preparata, F.P.

May 1986

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foun...

Sufficient Conditions, Cost Bounds, and Approximation Algorithms for the Graph Bisectioning Problem

Saab, Youssef Georges
Rao, Vasant B.

June 1990

Coordinated Science Laboratory was formerly known as Control Systems LaboratorySemiconductor Researc...

An Optimal Algorithm for Determining the Separation of Two Nonintersecting Simple Polygons

Amato, Nancy M.

December 1992

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Institute of Theoretical Informatics

Kahip Karlsruhe
High Quality Partitioning
Peter S
Christian Schulz

January 2016

Due to many technical advances of the last decades, networks are used everywhere. Graphs can be used...

New algorithm for finding minimum vertex cut set

Ugurlu O.
Berberler M.E.
Kizilates G.
Kurt M.

January 2012

2012 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012 -- 12 Septemb...

Minimal separating sets of maximum size

Alavi, Y
Behzad, M
Nordhaus, E.A

April 1980

AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...

Fast and Processor-Efficient Parallel Algorithms for Reducible Flow Graphs

Ramachandran, Vijaya

November 1988

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

New mathematical model for finding minimum vertex cut set

Beşeri Sevim, Tina
Kutucu, Hakan
Berberler, Murat Erşen

January 2012

4th International Conference on Problems of Cybernetics and Informatics, PCI 2012; Baku; Azerbaijan;...

A Characterization of the Smallest Eigenvalue of a Graph

Desai, Madhav P.
Rao, Vasant B.

July 1991

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryAir Force Office of S...

Vertex Connectivity of Graphs: Algorithms and Bounds

Kanevsky, Arkady

January 10000

131 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This thesis concerns several ...

Steps into Computational Geometry

Preparata, F.P.

March 1977

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Finding All Minimum Size Separating Vertex Sets in a Graph

Kanevsky, Arkady

July 1988

Coordinated Science Laboratory was formerly known as Control Systems LaboratorySemiconductor Researc...

On Finding the Vertex Connectivity of Graphs

Girkar, Milind
Sohoni, Milind

May 1987

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Compact Representation of the Separating k-Sets of a Graph

Kanevsky, Arkady

January 1988

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foun...

On the Number of Minimum Size Separating Vertex Sets in a Graph

Kanevsky, Arkady

July 1987

National Science Foundation / ECS 84-10902 and 8404866Semiconductor Research Corporation / 86-12-109...

Minimum Polygonal Separation

Edelsbrunner, H.
Preparata, F.P.

May 1986

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foun...

Sufficient Conditions, Cost Bounds, and Approximation Algorithms for the Graph Bisectioning Problem

Saab, Youssef Georges
Rao, Vasant B.

June 1990

Coordinated Science Laboratory was formerly known as Control Systems LaboratorySemiconductor Researc...

An Optimal Algorithm for Determining the Separation of Two Nonintersecting Simple Polygons

Amato, Nancy M.

December 1992

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Institute of Theoretical Informatics

Kahip Karlsruhe
High Quality Partitioning
Peter S
Christian Schulz

January 2016

Due to many technical advances of the last decades, networks are used everywhere. Graphs can be used...

New algorithm for finding minimum vertex cut set

Ugurlu O.
Berberler M.E.
Kizilates G.
Kurt M.

January 2012

2012 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012 -- 12 Septemb...

Minimal separating sets of maximum size

Alavi, Y
Behzad, M
Nordhaus, E.A

April 1980

AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...

Fast and Processor-Efficient Parallel Algorithms for Reducible Flow Graphs

Ramachandran, Vijaya

November 1988

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

New mathematical model for finding minimum vertex cut set

Beşeri Sevim, Tina
Kutucu, Hakan
Berberler, Murat Erşen

January 2012

4th International Conference on Problems of Cybernetics and Informatics, PCI 2012; Baku; Azerbaijan;...

A Characterization of the Smallest Eigenvalue of a Graph

Desai, Madhav P.
Rao, Vasant B.

July 1991

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryAir Force Office of S...

Vertex Connectivity of Graphs: Algorithms and Bounds

Kanevsky, Arkady

January 10000

131 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This thesis concerns several ...

Steps into Computational Geometry

Preparata, F.P.

March 1977

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...

Finding All Minimum Size Separating Vertex Sets in a Graph

Abstract

Extracted data

Finding All Minimum Size Separating Vertex Sets in a Graph

Abstract

Extracted data

Related items

Related items