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

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

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

On the b-dominating coloring of graphsHOANG, C. T; KOUIDER, Mekkia.Discrete applied mathematics. 2005, Vol 152, Num 1-3, pp 176-186, issn 0166-218X, 11 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

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

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

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

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

Distributed computing on regular networks with anonymous nodesLAKSHMAN, T. V; WEI, V. K.IEEE transactions on computers. 1994, Vol 43, Num 2, pp 211-218, issn 0018-9340Article

On large induced trees and long induced paths in sparse random graphsSUEN, W. C. S.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 250-262, issn 0095-8956Article

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

An exact algorithm for MAX-CUT in sparse graphsCROCE, F. Della; KAMINSKI, M. J; PASCHOS, V. Th et al.Operations research letters. 2007, Vol 35, Num 3, pp 403-408, issn 0167-6377, 6 p.Article

On bipartite graphs with weak density of some subgraphsFOUQUET, Jean-Luc; VANHERPE, Jean-Marie.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1516-1524, issn 0012-365X, 9 p.Conference Paper

Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networksSTEFANOVIC, Cedomir; VUKOBRATOVIC, Dejan; STANKOVIC, Vladimir et al.Ad hoc networks. 2013, Vol 11, Num 1, pp 167-181, issn 1570-8705, 15 p.Article

Finding Hidden Hubs and Dominating Sets in Sparse Graphs by Randomized Neighborhood QueriesDAMASCHKE, Peter.Networks (New York, NY). 2011, Vol 57, Num 4, pp 344-350, issn 0028-3045, 7 p.Article

Ensembles of relational classifiersPREISACH, Christine; SCHMIDT-THIEME, Lars.Knowledge and information systems. 2008, Vol 14, Num 3, pp 249-272, 24 p.Article

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

One sided crossing minimization is NP-hard for sparse graphsMUNOZ, Xavier; UNGER, W; VRTO, Imrich et al.Lecture notes in computer science. 2002, pp 115-123, issn 0302-9743, isbn 3-540-43309-0Conference 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

On the p-connectedness of graphs: a surveyBABEL, L; OLARIU, S.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 11-33, issn 0166-218XConference Paper