Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Mathematics
Combinatorics
On an Algorithm of Frieze
Howard Kleiman
Abstract
The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algorithms for obtaining solutions to the AP and the TSP.
Full PDF
Related Researches
Reconstruction of small graphs and tournaments
by
Brendan D. McKay
Partial-dual genus polynomials and signed intersection graphs
by
Qi Yan
Critical varieties in the Grassmannian
by
Pavel Galashin
On the stability of graph independence number
by
Zichao Dong
Markov models for the tipsy cop and robber game on graphs
by
Viktoriya Bardenova
Chromatic bounds for the subclasses of p K 2 -free graphs
by
Athmakoori Prashant
Graphs of Maximal Energy with Fixed Maximal Degree
by
Octavio Arizmendi
Digital almost nets
by
Boris Bukh
Degree conditions forcing directed cycles
by
Andrzej Grzesik
The game of Flipping Coins
by
Anthony Bonato
Monotone and cone preserving mappings on posets
by
Ivan Chajda
Covering 2-colored complete digraphs by monochromatic d -dominating digraphs
by
Louis DeBiasio
Shellability and homology of q -complexes and q -matroids
by
Sudhir R. Ghorpade
Determinantal formulas with major indices
by
Thomas McConville
A lower bound theorem for d -polytopes with 2d+1 vertices
by
Guillermo Pineda-Villavicencio
Random hypergraphs and property B
by
Lech Duraj
A crank for bipartitions with designated summands
by
R. X. J. Hao
Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
by
Remie Janssen
The Hamilton-Waterloo problem on wreath product graph C m ?� K 16
by
L. Wang
Unity Product Graph of Some Commutative Rings
by
Mohammad Hassan Mudaber
Automorphisms of tropical Hassett spaces
by
Sam Freedman
On particular examples of planar integral point sets and their classification
by
Nikolai Avdeev
The "Grothendieck to Lascoux" conjecture
by
Victor Reiner
Rainbow spanning trees in random edge-colored graphs
by
Peter Bradshaw
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
by
Jianhua Tu
«
1
2
3
4
»
Submitted on 20 Feb 2001 (v1), last revised 29 May 2002 (this version, v4)
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar