7,129
个编辑
更改
无编辑摘要
*{{citation |title=Defining and locating cores and boundaries of social networks |first1=Patrick |last1=Doreian |first2=Katherine L. |last2=Woodard |journal=Social Networks |volume=16 |issue=4 |year=1994 |pages=267–293 |doi=10.1016/0378-8733(94)90013-2}}.
*{{citation |title=Defining and locating cores and boundaries of social networks |first1=Patrick |last1=Doreian |first2=Katherine L. |last2=Woodard |journal=Social Networks |volume=16 |issue=4 |year=1994 |pages=267–293 |doi=10.1016/0378-8733(94)90013-2}}.
*{{citation |first1=Paul |last1=Erdős |author1-link=Paul Erdős |first2=George |last2=Szekeres |author2-link=George Szekeres |title=A combinatorial problem in geometry |journal=Compositio Mathematica |volume=2 |year=1935 |pages=463–470 |url=http://www.renyi.hu/~p_erdos/1935-01.pdf}}.
*{{citation |first1=Paul |last1=Erdős |first2=George |last2=Szekeres |title=A combinatorial problem in geometry |journal=Compositio Mathematica |volume=2 |year=1935 |pages=463–470 |url=http://www.renyi.hu/~p_erdos/1935-01.pdf}}.
*{{citation |doi=10.1177/001872674900200205 |first=Leon |last=Festinger |title=The analysis of sociograms using matrix algebra |journal=Human Relations |year=1949 |volume=2 |issue=2 |pages=153–158 }}.
*{{citation |doi=10.1177/001872674900200205 |first=Leon |last=Festinger |title=The analysis of sociograms using matrix algebra |journal=Human Relations |year=1949 |volume=2 |issue=2 |pages=153–158 }}.
| last1 = Graham
| last1 = Graham
| first1 = R.
| first1 = R.
| last2 = Rothschild
| last2 = Rothschild
| first2 = B.
| first2 = B.
| last3 = Spencer
| last3 = Spencer
| first3 = J. H.
| first3 = J. H.
| location = New York
| location = New York
| publisher = John Wiley and Sons
| publisher = John Wiley and Sons
*{{citation |last1=Hamzaoglu |first1=I. |last2=Patel |first2=J. H. |contribution=Test set compaction algorithms for combinational circuits |title=Proc. 1998 IEEE/ACM International Conference on Computer-Aided Design |year=1998 |pages=283–289 |doi=10.1145/288548.288615|isbn=978-1581130089 }}.
*{{citation |last1=Hamzaoglu |first1=I. |last2=Patel |first2=J. H. |contribution=Test set compaction algorithms for combinational circuits |title=Proc. 1998 IEEE/ACM International Conference on Computer-Aided Design |year=1998 |pages=283–289 |doi=10.1145/288548.288615|isbn=978-1581130089 }}.
*{{citation | last=Karp |first=Richard M. |authorlink = Richard M. Karp | url = http://www.cs.berkeley.edu/~luca/cs172/karp.pdf |contribution= Reducibility among combinatorial problems | title = Complexity of Computer Computations | editor1-first = R. E. |editor1-last=Miller |editor2-first=J. W. |editor2-last=Thatcher | publisher = New York: Plenum | pages = 85–103 | year = 1972}}.
*{{citation | last=Karp |first=Richard M. | url = http://www.cs.berkeley.edu/~luca/cs172/karp.pdf |contribution= Reducibility among combinatorial problems | title = Complexity of Computer Computations | editor1-first = R. E. |editor1-last=Miller |editor2-first=J. W. |editor2-last=Thatcher | publisher = New York: Plenum | pages = 85–103 | year = 1972}}.
*{{citation |first1=F. S. |last1=Kuhl |first2=G. M. |last2=Crippen |first3=D. K. |last3=Friesen |year=1983 |title=A combinatorial algorithm for calculating ligand binding |journal=Journal of Computational Chemistry |doi=10.1002/jcc.540050105 |volume=5 |issue=1 |pages=24–34}}.
*{{citation |first1=F. S. |last1=Kuhl |first2=G. M. |last2=Crippen |first3=D. K. |last3=Friesen |year=1983 |title=A combinatorial algorithm for calculating ligand binding |journal=Journal of Computational Chemistry |doi=10.1002/jcc.540050105 |volume=5 |issue=1 |pages=24–34}}.
*{{citation |first=Kazimierz |last=Kuratowski |authorlink=Kazimierz Kuratowski |language=French |title=Sur le problème des courbes gauches en Topologie |journal=Fundamenta Mathematicae |volume=15 |year=1930 |pages=271–283 |url=http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf|doi=10.4064/fm-15-1-271-283 }}.
*{{citation |first=Kazimierz |last=Kuratowski |language=French |title=Sur le problème des courbes gauches en Topologie |journal=Fundamenta Mathematicae |volume=15 |year=1930 |pages=271–283 |url=http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf|doi=10.4064/fm-15-1-271-283 }}.
*{{citation
*{{citation
| last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
| last1 = Luce | first1 = R. Duncan
| last2 = Perry | first2 = Albert D.
| last2 = Perry | first2 = Albert D.
| title = A method of matrix analysis of group structure
| title = A method of matrix analysis of group structure
| journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
| journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
| pages = 95–116 | doi = 10.1007/BF02289146
| pages = 95–116 | doi = 10.1007/BF02289146
| pmid = 18152948| hdl = 10.1007/BF02289146 | s2cid = 16186758 | hdl-access = free }}.
| pmid = 18152948| hdl = 10.1007/BF02289146 | hdl-access = free }}.
*{{citation
*{{citation
| last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
| last1 = Moon | first1 = J. W. | last2 = Moser | first2 = L.
| title = On cliques in graphs
| title = On cliques in graphs
| journal = [[Israel Journal of Mathematics]]
| journal = [[Israel Journal of Mathematics]]
*{{citation
*{{citation
| last = Turán
| last = Turán
| first = Paul | author-link = Pál Turán
| first = Paul
| year = 1941
| year = 1941
| title = On an extremal problem in graph theory
| title = On an extremal problem in graph theory