Entry Irving:1984:SNP from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Irving:1984:SNP,
  author =       "Robert W. Irving",
  title =        "Short Notes: Permutation Backtracking in Lexicographic
                 Order",
  journal =      j-COMP-J,
  volume =       "27",
  number =       "4",
  pages =        "373--375",
  month =        nov,
  year =         "1984",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/27.4.373",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:17 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/27/4.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/",
  URL =          "http://comjnl.oxfordjournals.org/content/27/4/373.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/373.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/374.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/375.tif",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Salford, Dep of Mathematics, Salford, Engl",
  affiliationaddress = "Univ of Salford, Dep of Mathematics, Salford,
                 Engl",
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723",
  corpsource =   "Dept. of Math., Salford Univ., UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "algorithm theory; Algorithms; backtrack search;
                 computer programming; computer programs; Hamiltonian
                 cycle; lexicographic order; linked linear list; Pascal;
                 Pascal listings; permutation backtracking;
                 permutations",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries