Using composite low rank and sparse graph for label propagationJUNJUN GUO; DAIWEN WU.Electronics letters. 2014, Vol 50, Num 2, pp 84-86, issn 0013-5194, 3 p.Article

New algorithms for enumerating all maximal cliquesMAKINO, Kazuhisa; UNO, Takeaki.Lecture notes in computer science. 2004, pp 260-272, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Algorithms for the d-dimensional rigidity matroid of sparse graphsBEREG, Sergey.Lecture notes in computer science. 2005, pp 29-36, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 8 p.Conference Paper

On the recognition of probe graphs of some self-complementary classes of perfect graphsCHANG, Maw-Shang; KLOKS, Ton; KRATSCH, Dieter et al.Lecture notes in computer science. 2005, pp 808-817, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

Spanners with slackCHAN, T.-H. Hubert; DINITZ, Michael; GUPTA, Anupam et al.Lecture notes in computer science. 2006, pp 196-207, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Fully Dynamic Geometric SpannersRODITTY, L.Algorithmica. 2012, Vol 62, Num 3-4, pp 1073-1087, issn 0178-4617, 15 p.Article

Solving Diameter Constrained Minimum Spanning tree problems in dense graphsDOS SANTOS, Andréa C; LUCENA, Abilio; RIBEIRO, Celso C et al.Lecture notes in computer science. 2004, pp 458-467, issn 0302-9743, isbn 3-540-22067-4, 10 p.Conference Paper

A parametric filtering algorithm for the graph isomorphism problemSORLIN, Sébastien; SOLNON, Christine.Constraints (Dordrecht). 2008, Vol 13, Num 4, pp 518-537, issn 1383-7133, 20 p.Article

A fully dynamic algorithm for the recognition of P₄-sparse graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas; PAPADOPOULOS, Charis et al.Lecture notes in computer science. 2006, pp 256-268, issn 0302-9743, isbn 3-540-48381-0, 13 p.Conference Paper

Clustering of conceptual graphs with sparse dataGANASCIA, Jean-Gabriel; VELCIN, Julien.Lecture notes in computer science. 2004, pp 156-169, issn 0302-9743, isbn 3-540-22392-4, 14 p.Conference Paper

Parallel knock-out schemes in networksBROERSMA, Hajo; FOMIN, Fedor V; WOEGINGER, Gerhard J et al.Lecture notes in computer science. 2004, pp 204-214, issn 0302-9743, isbn 3-540-22823-3, 11 p.Conference Paper

Designing a Good Low-Rate Sparse-Graph CodeANDRIYANOVA, Iryna; TILLICH, Jean-Pierre.IEEE transactions on communications. 2012, Vol 60, Num 11, pp 3181-3190, issn 0090-6778, 10 p.Article

Distribution-Free Connectivity Testing for Sparse GraphsHALEVY, Shirley; KUSHILEVITZ, Eyal.Algorithmica. 2008, Vol 51, Num 1, pp 24-48, issn 0178-4617, 25 p.Article

Sparse directed acyclic word graphsINENAGA, Shunsuke; TAKEDA, Masayuki.Lecture notes in computer science. 2006, pp 63-73, issn 0302-9743, isbn 3-540-45774-7, 1Vol, 11 p.Conference Paper

I/O-Efficient algorithms on near-planar graphsHAVERKORT, Herman; TOMA, Laura.Lecture notes in computer science. 2006, pp 580-591, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

I/O-efficient undirected shortest paths with unbounded edge lengths (Extended Abstract)MEYER, Ulrich; ZEH, Norbert.Lecture notes in computer science. 2006, pp 540-551, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Sparse factor graph representations of reed-solomon and related codesYEDIDIA, Jonathan S.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 260Conference Paper

Exact crossing minimizationBUCHHEIM, Christoph; EBNER, Dietmar; JÜNGER, Michael et al.Lecture notes in computer science. 2006, pp 37-48, issn 0302-9743, isbn 3-540-31425-3, 1Vol, 12 p.Conference Paper

Networking Property During Epileptic Seizure with Multi-channel EEG RecordingsHUIHUA WU; XIAOLI LI; XINPING GUAN et al.Lecture notes in computer science. 2006, pp 564-569, issn 0302-9743, isbn 3-540-34439-X, 6 p.Conference Paper

Anonymizing bipartite graph data using safe groupingsCORMODE, Graham; SRIVASTAVA, Divesh; TING YU et al.The VLDB journal. 2010, Vol 19, Num 1, pp 115-139, issn 1066-8888, 25 p.Article

Parallel Inclusion-based Points-to AnalysisMENDEZ-LOJO, Mario; MATHEW, Augustine; PINGALI, Keshav et al.ACM SIGPLAN notices. 2010, Vol 45, Num 10, pp 428-443, issn 1523-2867, 16 p.Conference Paper

An Adaptive Spectral Heuristic for Partitioning Random GraphsCOJA-OGHLAN, Amin.Lecture notes in computer science. 2006, pp 691-702, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed MinorBUSCH, Costas; LAFORTUNE, Ryan; TIRTHAPURA, Srikanta et al.Algorithmica. 2014, Vol 69, Num 3, pp 658-684, issn 0178-4617, 27 p.Article

Graph mining for discovering infrastructure patterns in configuration management databasesANCHURI, Pranay; ZAKI, Mohammed J; BARKOL, Omer et al.Knowledge and information systems (Print). 2012, Vol 33, Num 3, pp 491-522, issn 0219-1377, 32 p.Article