1. Edge elimination and weighted graph classesJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, objavljeni znanstveni prispevek na konferenci Ključne besede: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm Objavljeno v RUP: 10.11.2020; Ogledov: 1391; Prenosov: 34 Povezava na celotno besedilo |
2. Linear separation of connected dominating sets in graphsNina Chiarelli, Martin Milanič, 2019, izvirni znanstveni članek Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithm Objavljeno v RUP: 04.04.2019; Ogledov: 2038; Prenosov: 158 Celotno besedilo (648,51 KB) |
3. Decomposing 1-Sperner hypergraphs, with applications to graphs, Journée-séminaire de combinatoire (équipe CALIN du LIPN, Université Paris-Nord, Villetaneuse), 11. 9. 2018Martin Milanič, 2018, predavanje na tuji univerzi Ključne besede: 1-Sperner hypergraph, threshold hypergraph, decomposition, threshold graph, clique-width Objavljeno v RUP: 30.09.2018; Ogledov: 1657; Prenosov: 20 Povezava na celotno besedilo |
4. Decomposing 1-Sperner hypergraphs, with applications to graphs, Séminaires du Pôle 2 : Optimisation combinatoire, algorithmique", LAMSADE, Université Paris-Dauphine, 17. 9. 2018Martin Milanič, 2018, predavanje na tuji univerzi Ključne besede: 1-Sperner hypergraph, threshold hypergraph, decomposition, threshold graph, clique-width Objavljeno v RUP: 30.09.2018; Ogledov: 1868; Prenosov: 22 Povezava na celotno besedilo |
5. |
6. |