Sciweavers

1027 search results - page 4 / 206
» Ordered Vertex Partitioning
Sort
View
ICCAD
1996
IEEE
111views Hardware» more  ICCAD 1996»
15 years 9 months ago
Multi-level spectral hypergraph partitioning with arbitrary vertex sizes
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
Jason Y. Zien, Martine D. F. Schlag, Pak K. Chan
151
Voted
ICALP
2010
Springer
15 years 9 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
109
Voted
ARSCOM
2008
77views more  ARSCOM 2008»
15 years 5 months ago
Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs
John P. McSorley, Philip Feinsilver, René S...
233
Voted
COMBINATORICS
2006
276views more  COMBINATORICS 2006»
15 years 5 months ago
On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs
Maria Axenovich