Results 261 to 270 of about 55,995 (279)
Some of the next articles are maybe not open access.
Refined topological vertex, cylindric partitions and adjoint theory
Nuclear Physics B, 2010Amer Iqbal, Khurram Shabbir
exaly
Linear Time Vertex Partitioning on Massive Graphs.
International journal of computer science (Rabat)The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds of nodes and less optimal but faster techniques that function on up to thousands of nodes.
Peter, Mell +2 more
openaire +1 more source
A VERTEX PARTITIONING OF A GRAPH
Proceedings of the Third Asian Mathematical Conference 2000, 2002SERGIO R. CANOY +2 more
openaire +1 more source
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
Journal of Graph Theory, 2013Fei Song
exaly
On vertex partitions and some minor-monotone graph parameters
Journal of Graph Theory, 2011Daniel Goncalves
exaly
On the weighted enumeration of alternating sign matrices and descending plane partitions
Journal of Combinatorial Theory - Series A, 2012Roger Behrend +2 more
exaly
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
Computers and Operations Research, 2005exaly
On Vertex Partitions and the Colin de Verdière Parameter
Electronic Notes in Discrete Mathematics, 2007Daniel Goncalves
exaly