Filtrer vos résultats
- 55
- 41
- 42
- 26
- 13
- 10
- 2
- 2
- 1
- 5
- 86
- 9
- 3
- 1
- 1
- 1
- 3
- 3
- 2
- 5
- 4
- 2
- 6
- 2
- 4
- 3
- 5
- 2
- 3
- 7
- 9
- 1
- 5
- 6
- 8
- 2
- 4
- 2
- 4
- 2
- 1
- 1
- 95
- 1
- 49
- 47
- 23
- 17
- 13
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 96
- 29
- 17
- 15
- 9
- 8
- 7
- 7
- 5
- 5
- 5
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
96 résultats
|
A Simple Paradigm for Graph Recognition : Application to Cographs and Distance Hereditary GraphsTheoretical Computer Science, 2001, 263 (1-2), pp.99-111. ⟨10.1016/S0304-3975(00)00234-6⟩
Article dans une revue
lirmm-00090372v1
|
||
|
Common Connected Components of Interval Graphs[Research Report] 03014, LIRMM (UM, CNRS). 2003, pp.13
Rapport
lirmm-00269438v1
|
||
|
Polynomial-time recognition of clique-width ≤3 graphsDiscrete Applied Mathematics, 2012, Fourth Workshop on Graph Classes, Optimization, and Width Parameters Bergen, Norway, October 2009: Bergen GROW 09, 160 (6), pp.834-865. ⟨10.1016/j.dam.2011.03.020⟩
Article dans une revue
hal-01274081v1
|
||
|
A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and AutomataSTACS: Symposium on Theoretical Aspects of Computer Science, Feb 1998, Paris, France. pp.25-38, ⟨10.1007/BFb0028546⟩
Communication dans un congrès
istex
inria-00471611v1
|
||
On the power of graph searching for cocomparability graphsSIAM Journal on Discrete Mathematics, 2016
Article dans une revue
hal-01273687v1
|
|||
|
Tree-representation of set families and applications to combinatorial decompositionsEuropean Journal of Combinatorics, 2012, 33 (5), pp.688-711. ⟨10.1016/j.ejc.2011.09.032⟩
Article dans une revue
hal-00555520v1
|
||
|
A Simple Linear Time LexBFS Cograph Recognition AlgorithmWG 2003 - 29th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2003, Elspeet, Netherlands. pp.119-130, ⟨10.1007/978-3-540-39890-5_11⟩
Communication dans un congrès
lirmm-00269525v1
|
||
|
Diameter Determination on Restricted Graph FamiliesDiscrete Applied Mathematics, 2001, 113 (2-3), pp.146-166. ⟨10.1016/S0166-218X(00)00281-X⟩
Article dans une revue
lirmm-00090363v1
|
||
Bimodular Decomposition of Bipartite GraphsWG'04: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, 2004, pp.117-128
Communication dans un congrès
lirmm-00108942v1
|
|||
|
Computational aspects of the 2-dimension of partially ordered setsTheoretical Computer Science, 2004, 312 (2-3), pp.401-431. ⟨10.1016/j.tcs.2003.10.029⟩
Article dans une revue
inria-00099966v1
|
||
Detecting 2-joins fasterJournal of Discrete Algorithms, 2012, 17, pp.60-66
Article dans une revue
ensl-00800019v1
|
|||
Representation theorems for two set families and applications to combinatorial decompositionsInternational Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS'08), 2008, Mahdia, Tunisia. pp.532-546
Communication dans un congrès
hal-00555315v1
|
|||
|
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order ExtensionSWAT 2004 - 9th Scandinavian Workshop on Algorithm Theory, Jul 2004, Humlebaek, Denmark. pp.187-198, ⟨10.1007/978-3-540-27810-8_17⟩
Communication dans un congrès
hal-00159601v1
|
||
|
Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testingTheoretical Computer Science, 2000, 234, ⟨10.1016/S0304-3975(97)00241-7⟩
Article dans une revue
inria-00471613v1
|
||
|
Computing H-Joins with Application to 2-Modular DecompositionAlgorithmica, 2014, 70 (2), pp.245-266. ⟨10.1007/s00453-013-9820-1⟩
Article dans une revue
hal-00921775v1
|
||
Guiding Random Walks by Effective Resistance for Effective Node EmbeddingICPRAI 2022 - 3rd International Conference on Pattern Recognition and Artificial Intelligence, Jun 2022, Paris, France. pp.665-676, ⟨10.1007/978-3-031-09037-0_54⟩
Communication dans un congrès
hal-03701161v1
|
|||
|
Competitive Graph SearchesRR-07017, 2007
Rapport
lirmm-00132103v3
|
||
|
A Note on Computing Set Overlap ClassesInformation Processing Letters, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩
Article dans une revue
lirmm-00325371v1
|
||
WG'09: International Workshop on Theoretic Concepts in Computer Science5911, 352 p., 2010, Lecture Notes in Computer Science
Ouvrages
lirmm-00533518v1
|
|||
|
Partition refinement and graph decompositionSymposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2
Communication dans un congrès
inria-00471612v1
|
||
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability GraphsSIAM Journal on Computing, 2013, 42 (3), pp.792-807. ⟨10.1137/11083856X⟩
Article dans une revue
hal-00936300v1
|
|||
Representing Partitive Crossing Families and Union-Difference Families, with Application to Sesquimodular DecompositionRR-07031, 2007
Rapport
lirmm-00199916v1
|
|||
|
Efficient algorithms on distributive latticesDiscrete Applied Mathematics, 2001, 110 (2-3), pp.169 - 187. ⟨10.1016/S0166-218X(00)00258-4⟩
Article dans une revue
hal-01765516v1
|
||
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs Graph-Theoretic Concepts in Computer Science - 40th International Workshop (WG 2014), Jun 2014, Orléans, France. pp.12
Communication dans un congrès
hal-01273669v1
|
|||
|
A Simple Linear Time Algorithm for Cograph RecognitionDiscrete Applied Mathematics, 2005, 145 (2), pp.183-197. ⟨10.1016/j.dam.2004.01.011⟩
Article dans une revue
lirmm-00105298v1
|
||
|
Fast Computation of Empirically Tight Bounds for the Diameter of Massive GraphsACM Journal of Experimental Algorithmics, 2009, 13, pp.10. ⟨10.1145/1412228.1455266⟩
Article dans une revue
hal-01146069v1
|
||
|
A New Graph Parameter to Measure LinearityCOCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.154-168, ⟨10.1007/978-3-319-71147-8_11⟩
Communication dans un congrès
hal-01672521v1
|
||
|
Revisiting T. Uno and M. Yagiura's Algorithm05049, 2005, 14 p
Rapport
lirmm-00106693v1
|
||
|
A Linear-Time Algorithm for Recognition of Catval GraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic
Communication dans un congrès
lirmm-00269443v1
|
||
|
Fast Diameter Computation within Split GraphsCOCOA 2019 - 13th Annual International Conference on Combinatorial Optimization and Applications, Dec 2019, Xiamen, China
Communication dans un congrès
hal-03373614v1
|