Entry Danilenko:2012:URD from lncs2012j.bib
Last update: Sun Oct 15 02:37:41 MDT 2017
Top |
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{Danilenko:2012:URD,
author = "Nikita Danilenko",
title = "Using Relations to Develop a {Haskell} Program for
Computing Maximum Bipartite Matchings",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7560",
pages = "130--145",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33314-9_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:57 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012j.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33314-9_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33314-9",
book-URL = "http://www.springerlink.com/content/978-3-642-33314-9",
fjournal = "Lecture Notes in Computer Science",
}
Related entries
- Computing,
7559(0)90,
7560(0)114,
7592(0)107,
7592(0)154,
7592(0)192,
7597(0)111
- Develop,
7594(0)55
- Matching,
7559(0)17,
7564(0)168,
7572(0)102,
7579(0)175,
7583(0)1,
7583(0)92,
7583(0)163,
7583(0)175,
7584(0)62,
7584(0)134,
7599(0)89
- Maximum,
7551(0)57,
7553(0)132,
7578(0)195
- Program,
7560(0)50,
7560(0)114,
7596(0)126,
7596(0)179
- relation,
7557(0)14,
7560(0)82,
7560(0)146,
7560(0)248,
7569(0)209,
7574(0)129
- Using,
7550(0)79,
7552(0)49,
7552(0)89,
7553(0)42,
7553(0)74,
7553(0)140,
7555(0)190,
7559(0)52,
7560(0)146,
7564(0)92,
7564(0)236,
7569(0)7,
7569(0)139,
7570(0)38,
7572(0)15,
7572(0)72,
7572(0)172,
7572(0)243,
7574(0)29,
7574(0)244,
7578(0)167,
7580(0)48,
7583(0)22,
7583(0)32,
7583(0)63,
7583(0)113,
7584(0)178,
7585(0)71,
7585(0)91,
7585(0)141,
7585(0)151,
7585(0)193,
7592(0)192,
7599(0)12,
7599(0)101