Entry Nagamochi:1995:FES from lncs1995a.bib

Last update: Mon Mar 13 02:22:13 MDT 2017

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{Nagamochi:1995:FES,
  author =       "H. Nagamochi and T. Ibaraki",
  title =        "A Faster Edge Splitting Algorithm in Multigraphs and
                 its Application to the Edge-Connectivity Augmentation
                 Problem",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "920",
  pages =        "403--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib",
  acknowledgement = ack-nhfb,
}

Related entries

algorithm, 892(0)125, 892(0)440, 894(0)40, 894(0)131, 894(0)182, 894(0)278, 894(0)364, 894(0)388, 894(0)428, 899(0)69, 899(0)123, 899(0)142, 900(0)157, 900(0)193, 900(0)255, 903(0)319, 903(0)371, 903(0)387, 904(0)287, 904(0)313, 904(0)342, 905(0)205, 907(0)346, 909(0)114, 911(0)257, 912(0)107, 912(0)161, 912(0)351, 912(0)364, 914(0)194, 915(0)364, 917(0)365, 919(0)392, 919(0)488, 919(0)514, 919(0)664, 920(0)1, 920(0)29, 920(0)95, 920(0)388, 921(0)106, 923(0)11, 925(0)308, 929(0)368, 929(0)733, 929(0)934, 930(0)231, 930(0)252, 930(0)315, 930(0)396, 930(0)478, 930(0)498, 930(0)527, 930(0)761, 930(0)822, 930(0)838, 935(0)21, 935(0)121, 936(0)416, 937(0)144, 937(0)162, 937(0)330, 937(0)340, 938(0)164, 939(0)42, 940(0)183, 944(0)99, 944(0)111, 944(0)232, 944(0)256, 944(0)268, 944(0)292, 945(0)98, 945(0)595, 947(0)2, 947(0)67, 947(0)97, 948(0)415, 950(0)433, 951(0)216, 952(0)2, 952(0)235
application, 888(0)9, 888(0)75, 894(0)274, 896(0)196, 897(0)157, 903(0)121, 903(0)206, 904(0)23, 905(0)460, 905(0)465, 905(0)535, 909(0)154, 913(0)54, 915(0)409, 915(0)651, 915(0)741, 917(0)21, 917(0)224, 919(0)14, 919(0)67, 919(0)94, 919(0)206, 919(0)257, 919(0)398, 919(0)684, 919(0)735, 919(0)772, 919(0)793, 924(0)162, 926(0)64, 926(0)207, 930(0)15, 930(0)137, 930(0)353, 930(0)389, 930(0)396, 930(0)934, 930(0)942, 931(0)235, 932(0)327, 933(0)354, 934(0)79, 934(0)103, 934(0)307, 935(0)103, 935(0)141, 936(0)41, 938(0)58, 939(0)127, 939(0)253, 944(0)99, 944(0)111, 944(0)220, 944(0)303, 945(0)217, 945(0)233, 945(0)440, 950(0)445, 951(0)170
Augmentation, 894(0)111
Edge, 894(0)96, 900(0)421, 905(0)242, 929(0)52
Faster, 928(0)113
multigraph, 892(0)217
problem, 888(0)9, 888(0)137, 894(0)119, 894(0)444, 895(0)239, 897(0)144, 900(0)95, 900(0)107, 900(0)193, 900(0)349, 900(0)409, 903(0)93, 903(0)232, 903(0)319, 903(0)343, 903(0)371, 909(0)27, 909(0)39, 909(0)214, 911(0)112, 911(0)257, 911(0)300, 911(0)323, 911(0)386, 911(0)427, 911(0)461, 912(0)17, 912(0)323, 914(0)210, 914(0)450, 914(0)457, 915(0)155, 917(0)224, 919(0)1, 919(0)300, 919(0)351, 919(0)392, 919(0)717, 919(0)729, 919(0)837, 920(0)29, 920(0)65, 920(0)80, 920(0)95, 920(0)110, 920(0)145, 920(0)157, 920(0)172, 920(0)292, 921(0)319, 923(0)139, 923(0)205, 923(0)267, 926(0)148, 929(0)530, 929(0)824, 930(0)239, 930(0)315, 930(0)361, 930(0)584, 930(0)619, 930(0)845, 932(0)54, 933(0)190, 933(0)217, 934(0)407, 937(0)298, 937(0)340, 937(0)395, 939(0)353, 944(0)63, 944(0)464, 944(0)487, 945(0)348, 948(0)21, 948(0)456, 950(0)182, 950(0)428