Search

Your search keyword '"Clique-width"' showing total 175 results

Search Constraints

Start Over You searched for: Descriptor "Clique-width" Remove constraint Descriptor: "Clique-width" Publisher ieee Remove constraint Publisher: ieee
175 results on '"Clique-width"'

Search Results

1. Succinct Data Structures for Small Clique-Width Graphs

2. Canonisation and Definability for Graphs of Bounded Rank Width

Catalog

Books, media, physical & digital resources

3. Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning

4. Establishing the community structure of signed interconnected graph in data

5. A Topology-Adaptive Strategy for Graph Traversing

6. Discovering B-coupling relationships in the bipartite hypergraph through link prediction in the unimodal graph

7. Similarity Search in Graph Databases: A Multi-Layered Indexing Approach

8. A Novel Method to Find Time Complexity of an Algorithm by Using Control Flow Graph

9. Evolving Multi-level Graph Partitioning Algorithms

10. GFP-X: A parallel approach to massive graph comparison using spark

11. Effective and efficient graph augmentation in large graphs

12. Summarizing big graphs by means of pseudo-boolean constraints

13. Detecting hotspots in network data based on spectral graph theory

14. Isoline-Enhanced Dynamic Graph Visualization

15. Distributed Incremental Graph Analysis

16. Continual and Cost-Effective Partitioning of Dynamic Graphs for Optimizing Big Graph Processing Systems

17. Fast top-k search in knowledge graphs

18. Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs

19. A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization

20. Durable graph pattern queries on historical graphs

21. Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem

22. A streaming graph partitioning approach on imbalance cluster

23. Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms

24. A Reachability Query Method Based on Labeling Index on Large-Scale Graphs

25. Automatic Taxonomy Extraction from Bipartite Graphs

26. Towards Frequent Subgraph Mining on Single Large Uncertain Graphs

27. TeGViz: Distributed Tera-Scale Graph Generation and Visualization

28. Performance of graph reconstruction method for large-scale web graph analysis

29. Parallel Modularity-Based Community Detection on Large-Scale Graphs

30. Lossy Compression of Dynamic, Weighted Graphs

31. Weighted group-consensus analysis of multi-agent systems on a directed bipartite graph

32. Detection of graph structures via communications over a multiaccess Boolean channel

33. Refining graph matching using inherent structure information

34. Graph Laplacians and Least Squares on Graphs

35. Graph based verification of software and identification of defects by binary search on graph

36. Declarative Patterns for Imperative Distributed Graph Algorithms

37. Safe labeling of graphs with minimum span

38. Labeling techniques on Pn+1* graph

39. Mining maximal cliques from an uncertain graph

40. Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs

41. Set-based approach for lossless graph summarization using Locality Sensitive Hashing

42. Laplacian-based dynamic graph visualization

43. Graph relationship discovery using Pregel computing model

44. Set-Based Unified Approach for Attributed Graph Summarization

45. The NP-completeness of Eulerian Recurrent Length for 4-regular Eulerian Graphs

46. Fast Iterative Graph Computation: A Path Centric Approach

47. A Graphical Language to Query Conceptual Graphs

48. The Chinese Conceptual Graph Matching Algorithm Based on Conceptual Sub-graph Weight Self-Adjustment

49. Extending SPARQL with graph functions

50. Optimizing graph queries with graph joins and Sprinkle SPARQL