PUMA publications for /tag/Theoryhttps://puma.uni-kassel.de/tag/TheoryPUMA RSS feed for /tag/Theory2024-03-29T08:47:23+01:00- Finding community structure in networks using the eigenvectors of matriceshttps://puma.uni-kassel.de/bibtex/2090a24e34da3d0ab3d14d61dd3ad3285/folkefolke2010-05-04T08:55:46+02:00community detection graph modularity spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="MEJ Newman" itemprop="url" href="/author/MEJ%20Newman"><span itemprop="name">M. Newman</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Physical Review E</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">74 </span></span>(<span itemprop="issueNumber">3</span>):
<span itemprop="pagination">36104</span></em> </span>(<em><span>2006<meta content="2006" itemprop="datePublished"/></span></em>)
- Spectral Graph Theoryhttps://puma.uni-kassel.de/bibtex/295ef10b5a69a03d8507240b6cf410f8a/folkefolke2010-05-04T08:55:46+02:00graph spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="F. R. K. Chung" itemprop="url" href="/author/F.%20R.%20K.%20Chung"><span itemprop="name">F. Chung</span></a></span>. </span><em><span itemprop="publisher">American Mathematical Society</span>, </em>(<em><span>1997<meta content="1997" itemprop="datePublished"/></span></em>)
- On Spectral Bounds for the k-Partitioning of Graphshttps://puma.uni-kassel.de/bibtex/26ae2643d830d183886ee56d87dc4482d/folkefolke2010-05-04T08:55:46+02:00graph spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="B. Monien" itemprop="url" href="/author/B.%20Monien"><span itemprop="name">B. Monien</span></a></span>. </span>(<em><span>2001<meta content="2001" itemprop="datePublished"/></span></em>)
- The Laplacian spectrum of graphshttps://puma.uni-kassel.de/bibtex/23d63879e040c1a1ccd239ffaffb0189a/folkefolke2010-05-04T08:55:46+02:00graph laplacian spectral survey theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="B. Mohar" itemprop="url" href="/author/B.%20Mohar"><span itemprop="name">B. Mohar</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Graph Theory, Combinatorics, and Applications</em></span></span> </span>(<em><span>1991<meta content="1991" itemprop="datePublished"/></span></em>)
- Spectral Graph Theory and its Applicationshttps://puma.uni-kassel.de/bibtex/22db3b428400813210d3649d3cb879071/folkefolke2010-05-04T08:55:46+02:00graph spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="D.A. Spielman" itemprop="url" href="/author/D.A.%20Spielman"><span itemprop="name">D. Spielman</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on</em></span></span> </span>(<em><span>Oktober 2007<meta content="Oktober 2007" itemprop="datePublished"/></span></em>)
- Identifying the Minimal Transversals of a Hypergraph and Related Problemshttps://puma.uni-kassel.de/bibtex/2cd05f6dae9a4feed33fa7df223ab89ec/folkefolke2010-05-04T08:55:46+02:00complexity conp hypergraph theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Thomas Eiter" itemprop="url" href="/author/Thomas%20Eiter"><span itemprop="name">T. Eiter</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Georg Gottlob" itemprop="url" href="/author/Georg%20Gottlob"><span itemprop="name">G. Gottlob</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>SIAM J. Comput.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">24 </span></span>(<span itemprop="issueNumber">6</span>):
<span itemprop="pagination">1278--1304</span></em> </span>(<em><span>1995<meta content="1995" itemprop="datePublished"/></span></em>)
- On the intractability of computing the Duquenne-Guigues basehttps://puma.uni-kassel.de/bibtex/27d4e785ce77ab0df94fd2786c2ea0a7a/folkefolke2010-05-04T08:55:46+02:00base complexity duquenne-guigues fca pseudo-intent theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="S.O. Kuznetsov" itemprop="url" href="/author/S.O.%20Kuznetsov"><span itemprop="name">S. Kuznetsov</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Journal of Universal Computer Science</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">10 </span></span>(<span itemprop="issueNumber">8</span>):
<span itemprop="pagination">927--933</span></em> </span>(<em><span>2004<meta content="2004" itemprop="datePublished"/></span></em>)
- Counting Pseudo-intents and #P-completenesshttps://puma.uni-kassel.de/bibtex/2de0a8419ab5d374012b9d05498f840b0/folkefolke2010-05-04T08:55:46+02:00#P complexity fca pseudo-intent theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei Kuznetsov" itemprop="url" href="/author/Sergei%20Kuznetsov"><span itemprop="name">S. Kuznetsov</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei Obiedkov" itemprop="url" href="/author/Sergei%20Obiedkov"><span itemprop="name">S. Obiedkov</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Formal Concept Analysis</em></span></span> </span>(<em><span>2006<meta content="2006" itemprop="datePublished"/></span></em>)
- Some decision and counting problems of the Duquenne-Guigues basis of implicationshttps://puma.uni-kassel.de/bibtex/25cc734b8c96126d43e9b6c1fc91933d9/folkefolke2010-05-04T08:55:46+02:00complexity fca pseudo-intent theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei O. Kuznetsov" itemprop="url" href="/author/Sergei%20O.%20Kuznetsov"><span itemprop="name">S. Kuznetsov</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei Obiedkov" itemprop="url" href="/author/Sergei%20Obiedkov"><span itemprop="name">S. Obiedkov</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Discrete Appl. Math.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">156 </span></span>(<span itemprop="issueNumber">11</span>):
<span itemprop="pagination">1994--2003</span></em> </span>(<em><span>2008<meta content="2008" itemprop="datePublished"/></span></em>)
- On generating all maximal independent setshttps://puma.uni-kassel.de/bibtex/23766db2fcdce6f15149ddbd4829ac380/folkefolke2010-05-04T08:55:46+02:00complexity graph independent sets theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="David S. Johnson" itemprop="url" href="/author/David%20S.%20Johnson"><span itemprop="name">D. Johnson</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Christos H. Papadimitriou" itemprop="url" href="/author/Christos%20H.%20Papadimitriou"><span itemprop="name">C. Papadimitriou</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Inf. Process. Lett.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">27 </span></span>(<span itemprop="issueNumber">3</span>):
<span itemprop="pagination">119--123</span></em> </span>(<em><span>1988<meta content="1988" itemprop="datePublished"/></span></em>)
- Generating bicliques of a graph in lexicographic orderhttps://puma.uni-kassel.de/bibtex/2a60e9536a13fe8f8250b9dac4005130d/folkefolke2010-05-04T08:55:46+02:00conp graph independent set theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="VĂ¢nia M.F. Dias" itemprop="url" href="/author/V%c3%a2nia%20M.F.%20Dias"><span itemprop="name">V. Dias</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Celina M.H. de Figueiredo" itemprop="url" href="/author/Celina%20M.H.%20de%20Figueiredo"><span itemprop="name">C. de Figueiredo</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jayme L. Szwarcfiter" itemprop="url" href="/author/Jayme%20L.%20Szwarcfiter"><span itemprop="name">J. Szwarcfiter</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Theoretical Computer Science</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">337 </span></span>(<span itemprop="issueNumber">1-3</span>):
<span itemprop="pagination">240 - 248</span></em> </span>(<em><span>2005<meta content="2005" itemprop="datePublished"/></span></em>)
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryhttps://puma.uni-kassel.de/bibtex/2225afe6fe72eeacb777f7dab77488bb7/folkefolke2010-05-04T08:55:46+02:00graph spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="M. Fiedler" itemprop="url" href="/author/M.%20Fiedler"><span itemprop="name">M. Fiedler</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Czechoslovak Mathematical Journal</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">25 </span></span>(<span itemprop="issueNumber">100</span>):
<span itemprop="pagination">619--633</span></em> </span>(<em><span>1975<meta content="1975" itemprop="datePublished"/></span></em>)
- The second eigenvalue of the Google matrixhttps://puma.uni-kassel.de/bibtex/2bc3bddcd6ea80eea5716492751bdff36/folkefolke2010-05-04T08:55:46+02:00graph pagerank spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="T.H. Haveliwala" itemprop="url" href="/author/T.H.%20Haveliwala"><span itemprop="name">T. Haveliwala</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="S.D. Kamvar" itemprop="url" href="/author/S.D.%20Kamvar"><span itemprop="name">S. Kamvar</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>A Stanford University Technical Report http://dbpubs. stanford. edu</em></span></span> </span>(<em><span>2003<meta content="2003" itemprop="datePublished"/></span></em>)
- Co-clustering documents and words using bipartite spectral graph partitioninghttps://puma.uni-kassel.de/bibtex/2f07d9cc4813f3ecda75e6f0c8025cece/folkefolke2010-05-04T08:55:46+02:00community detection graph spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Inderjit S. Dhillon" itemprop="url" href="/author/Inderjit%20S.%20Dhillon"><span itemprop="name">I. Dhillon</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining</span>, </em></span><em>Seite <span itemprop="pagination">269--274</span>. </em><em>New York, NY, USA, </em><em><span itemprop="publisher">ACM Press</span>, </em>(<em><span>2001<meta content="2001" itemprop="datePublished"/></span></em>)
- Graph Separatorshttps://puma.uni-kassel.de/bibtex/280652189b18c675d10b77a96e2adfafc/folkefolke2010-05-04T08:55:46+02:00graph separators theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Guy Blelloch" itemprop="url" href="/author/Guy%20Blelloch"><span itemprop="name">G. Blelloch</span></a></span>. </span>(<em><span>2002<meta content="2002" itemprop="datePublished"/></span></em>)
- Partitioning Sparse Matrices with Eigenvectors of Graphshttps://puma.uni-kassel.de/bibtex/27444914fc73fc8ec12a67e5e172c34c0/folkefolke2010-05-04T08:55:46+02:00clustering community graph partitioning spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="A. Pothen" itemprop="url" href="/author/A.%20Pothen"><span itemprop="name">A. Pothen</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="H.D. Simon" itemprop="url" href="/author/H.D.%20Simon"><span itemprop="name">H. Simon</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="K.P. Liou" itemprop="url" href="/author/K.P.%20Liou"><span itemprop="name">K. Liou</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>SIAM J. MATRIX ANAL. APPLIC.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">11 </span></span>(<span itemprop="issueNumber">3</span>):
<span itemprop="pagination">430--452</span></em> </span>(<em><span>1990<meta content="1990" itemprop="datePublished"/></span></em>)
- Spectral K-way ratio-cut partitioning and clustering.https://puma.uni-kassel.de/bibtex/29aabfb2ef97763db1ae308576b8c0258/folkefolke2010-05-04T08:55:46+02:00community detection graph partitioning spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Pak K. Chan" itemprop="url" href="/author/Pak%20K.%20Chan"><span itemprop="name">P. Chan</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Martine D. F. Schlag" itemprop="url" href="/author/Martine%20D.%20F.%20Schlag"><span itemprop="name">M. Schlag</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jason Y. Zien" itemprop="url" href="/author/Jason%20Y.%20Zien"><span itemprop="name">J. Zien</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>IEEE Trans. on CAD of Integrated Circuits and Systems</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">13 </span></span>(<span itemprop="issueNumber">9</span>):
<span itemprop="pagination">1088-1096</span></em> </span>(<em><span>1994<meta content="1994" itemprop="datePublished"/></span></em>)
- Multiclass Spectral Clusteringhttps://puma.uni-kassel.de/bibtex/2d73e1ffedf586cdbaf076277e7c1add6/folkefolke2010-05-04T08:55:46+02:00Spectral graph partitioning theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stella X. Yu" itemprop="url" href="/author/Stella%20X.%20Yu"><span itemprop="name">S. Yu</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jianbo Shi" itemprop="url" href="/author/Jianbo%20Shi"><span itemprop="name">J. Shi</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proc. International Conference on Computer Vision (ICCV 03)</span>, </em></span><em>Nice, France, </em>(<em><span>Oktober 2003<meta content="Oktober 2003" itemprop="datePublished"/></span></em>)
- New spectral methods for ratio cut partitioning and clustering.https://puma.uni-kassel.de/bibtex/274b87fbffdbc96f4b8ff54c92dc45485/folkefolke2010-05-04T08:55:46+02:00graph partitioning spectral theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lars W. Hagen" itemprop="url" href="/author/Lars%20W.%20Hagen"><span itemprop="name">L. Hagen</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andrew B. Kahng" itemprop="url" href="/author/Andrew%20B.%20Kahng"><span itemprop="name">A. Kahng</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>IEEE Trans. on CAD of Integrated Circuits and Systems</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">11 </span></span>(<span itemprop="issueNumber">9</span>):
<span itemprop="pagination">1074-1085</span></em> </span>(<em><span>1992<meta content="1992" itemprop="datePublished"/></span></em>)
- Tag recommendations based on tensor dimensionality reductionhttps://puma.uni-kassel.de/bibtex/2e93afe409833a632af02290bbe134cba/folkefolke2010-05-04T08:55:46+02:00community detection graph recommender spectral tag theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Panagiotis Symeonidis" itemprop="url" href="/author/Panagiotis%20Symeonidis"><span itemprop="name">P. Symeonidis</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Alexandros Nanopoulos" itemprop="url" href="/author/Alexandros%20Nanopoulos"><span itemprop="name">A. Nanopoulos</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yannis Manolopoulos" itemprop="url" href="/author/Yannis%20Manolopoulos"><span itemprop="name">Y. Manolopoulos</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems</span>, </em></span><em>Seite <span itemprop="pagination">43--50</span>. </em><em>New York, NY, USA, </em><em><span itemprop="publisher">ACM</span>, </em>(<em><span>2008<meta content="2008" itemprop="datePublished"/></span></em>)