American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(05C70) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 14 of 14 found      Go to page: 1

[1] Yi-Huang Shen. When will the Stanley depth increase?. Proc. Amer. Math. Soc. 141 (2013) 2265-2274.
Abstract, references, and article information   
View Article: PDF

[2] Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya and Bora Uçar. UMPa: A multi-objective, multi-level partitioner for communication minimization. Contemporary Mathematics 588 (2013) 53-65.
Book volume table of contents   
View Article: PDF

[3] B. O. Fagginger Auer and R. H. Bisseling. Abusing a hypergraph partitioner for unweighted graph partitioning. Contemporary Mathematics 588 (2013) 19-35.
Book volume table of contents   
View Article: PDF

[4] Ümit V. Çatalyürek, Kamer Kaya, Johannes Langguth and Bora Uçar. A partitioning-based divisive clustering technique for maximizing the modularity. Contemporary Mathematics 588 (2013) 171-186.
Book volume table of contents   
View Article: PDF

[5] Aydın Buluç and Kamesh Madduri. Graph partitioning for scalable distributed graph computations. Contemporary Mathematics 588 (2013) 83-101.
Book volume table of contents   
View Article: PDF

[6] Peter Sanders and Christian Schulz. High quality graph partitioning. Contemporary Mathematics 588 (2013) 1-17.
Book volume table of contents   
View Article: PDF

[7] B. O. Fagginger Auer and R. H. Bisseling. Graph coarsening and clustering on the GPU. Contemporary Mathematics 588 (2013) 223-240.
Book volume table of contents   
View Article: PDF

[8] Michael Ovelgönne and Andreas Geyer-Schulz. An ensemble learning strategy for graph clustering. Contemporary Mathematics 588 (2013) 187-205.
Book volume table of contents   
View Article: PDF

[9] Anderson N. Martinhão and Emerson L. Monte Carmelo. Short covering codes arising from matchings in weighted graphs. Math. Comp. 82 (2013) 605-616.
Abstract, references, and article information   
View Article: PDF

[10] Raphael Yuster. Rainbow decompositions. Proc. Amer. Math. Soc. 136 (2008) 771-779. MR 2361848.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[11] Tomás Feder. Stable networks and product graphs. Memoirs of the AMS 116 (1995) MR 1271694.
Book volume table of contents   

[12] Brian Alspach, Luis Goddyn and Cun Quan Zhang. Graphs with the circuit cover property . Trans. Amer. Math. Soc. 344 (1994) 131-154. MR 1181180.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[13] E. Seah and D. R. Stinson. On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groups . Math. Comp. 50 (1988) 607-618. MR 929557.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[14] Henry A. Kierstead. An effective version of Hall's theorem . Proc. Amer. Math. Soc. 88 (1983) 124-128. MR 691291.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 1 to 14 of 14 found      Go to page: 1